Pages that link to "Item:Q1236426"
From MaRDI portal
The following pages link to On the completeness of the inductive assertion method (Q1236426):
Displaying 17 items.
- Developments in concurrent Kleene algebra (Q299202) (← links)
- Propositional dynamic logic of nonregular programs (Q792083) (← links)
- Semantical analysis of specification logic (Q913527) (← links)
- Generalised quantum weakest preconditions (Q993477) (← links)
- Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic (Q1139368) (← links)
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I (Q1143165) (← links)
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II (Q1152704) (← links)
- Axiomatic data type specifications: A first order theory of linear lists (Q1153682) (← links)
- Programs as partial graphs. I: Flow equivalence and correctness (Q1168723) (← links)
- Programs as partial graphs. II: Recursion (Q1168724) (← links)
- An execution mechanism for nondeterministic, state-oriented programs based on a chart parser (Q1209991) (← links)
- Least fixed points revisited (Q1234588) (← links)
- Recursive assertions are not enough - or are they? (Q1252031) (← links)
- Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming (Q2640347) (← links)
- Exploring an Interface Model for CKA (Q2941164) (← links)
- The Birth of Model Checking (Q3512430) (← links)
- Natural Quantum Operational Semantics with Predicates (Q5324519) (← links)
