scientific article; zbMATH DE number 3448070
From MaRDI portal
Publication:4772698
zbMath0285.68011MaRDI QIDQ4772698
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) General topics in the theory of software (68N01) Computability and recursion theory (03D99)
Related Items (25)
Termination of rewriting ⋮ Automatic synthesis of logical models for order-sorted first-order theories ⋮ The validity of return address schemes ⋮ Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic ⋮ Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II ⋮ Axiomatic data type specifications: A first order theory of linear lists ⋮ Floyd's principle, correctness theories and program equivalence ⋮ A survey of state vectors ⋮ Programs as partial graphs. I: Flow equivalence and correctness ⋮ A mechanical analysis of program verification strategies ⋮ Proving assertions about parallel programs ⋮ SEMANOL (73), a metalanguage for programming the semantics of programming languages ⋮ Composition of relational productions for plans and programs ⋮ Production rules as a representation for a knowledge-based consultation program ⋮ On the completeness of the inductive assertion method ⋮ Correctness of parallel programs: The Church-Rosser approach ⋮ PASCAL in LCF: Semantics and examples of proof ⋮ Recursive assertions are not enough - or are they? ⋮ Regular expressions and the equivalence of programs ⋮ Equivalences on program schemes ⋮ Mathematical theory of partial correctness ⋮ Current methods for proving program correctness ⋮ Algorithmic approximations ⋮ Correctness of recursive parallel nondeterministic flow programs ⋮ The axiomatic semantics of programs based on Hoare's logic
This page was built for publication:
