Pages that link to "Item:Q2561836"
From MaRDI portal
The following pages link to Consistent and complementary formal theories of the semantics of programming languages (Q2561836):
Displayed 23 items.
- Proving program inclusion using Hoare's logic (Q789887) (← links)
- Average case optimality for linear problems (Q796299) (← links)
- The axiomatic semantics of programs based on Hoare's logic (Q800712) (← links)
- Semantical analysis of specification logic (Q913527) (← links)
- Ten years of Hoare's logic: A survey. II: Nondeterminism (Q1056534) (← links)
- The formal definition of a real-time language (Q1153685) (← links)
- A simple relation between relational and predicate transformer semantics for nondeterministic programs (Q1156476) (← links)
- Floyd's principle, correctness theories and program equivalence (Q1158948) (← links)
- An axiomatic proof technique for parallel programs (Q1219675) (← links)
- Axiomatic approach to side effects and general jumps (Q1225451) (← links)
- On an equivalence between continuation and stack semantics (Q1247741) (← links)
- The clean termination of Pascal programs (Q1253540) (← links)
- Program invariants as fixedpoints (Q1254848) (← links)
- Propositional dynamic logic of regular programs (Q1258296) (← links)
- Correct translation of data parallel assignment onto array processors (Q1336950) (← links)
- Equivalence of formal semantics definition methods (Q1355752) (← links)
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation (Q1605224) (← links)
- Predicate transformers as power operations (Q1898816) (← links)
- General correctness: A unification of partial and total correctness (Q2265798) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- Some applications of topology to program semantics (Q3340119) (← links)
- (Q3883458) (← links)
- Current methods for proving program correctness (Q3911363) (← links)