The following pages link to (Q4772698):
Displaying 23 items.
- A survey of state vectors (Q458456) (← links)
- Correctness of recursive parallel nondeterministic flow programs (Q789165) (← links)
- The axiomatic semantics of programs based on Hoare's logic (Q800712) (← links)
- A mechanical analysis of program verification strategies (Q928673) (← links)
- Termination of rewriting (Q1098624) (← 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. II (Q1152704) (← links)
- Axiomatic data type specifications: A first order theory of linear lists (Q1153682) (← links)
- Floyd's principle, correctness theories and program equivalence (Q1158948) (← links)
- Programs as partial graphs. I: Flow equivalence and correctness (Q1168723) (← links)
- Proving assertions about parallel programs (Q1215264) (← links)
- SEMANOL (73), a metalanguage for programming the semantics of programming languages (Q1219158) (← links)
- Production rules as a representation for a knowledge-based consultation program (Q1232910) (← links)
- On the completeness of the inductive assertion method (Q1236426) (← links)
- Correctness of parallel programs: The Church-Rosser approach (Q1241051) (← links)
- PASCAL in LCF: Semantics and examples of proof (Q1242670) (← links)
- Recursive assertions are not enough - or are they? (Q1252031) (← links)
- The validity of return address schemes (Q1394113) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Regular expressions and the equivalence of programs (Q2536436) (← links)
- Equivalences on program schemes (Q2543557) (← links)
- Mathematical theory of partial correctness (Q2545842) (← links)
- Algorithmic approximations (Q2553150) (← links)
