The Formal System of Dijkstra and Scholten

DOI10.1007/978-3-319-23165-5_27zbMath1322.03025OpenAlexW2188347971MaRDI QIDQ2945729

Camilo Rocha

Publication date: 14 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23165-5_27

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• CalcCheck

Cites Work

• An elementary and unified approach to program correctness
• Equational propositional logic
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• Intuitionistic logic according to Dijkstra's calculus of equational deduction
• Dijkstra-Scholten predicate calculus: Concepts and misconceptions
• Equational rules for rewriting logic
• On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
• Semantic foundations for generalized rewrite theories
• On the Soundness and Completeness of Equational Predicate Logics
• Theorem Proving Modulo Based on Boolean Equational Procedures
• Operational Termination of Membership Equational Programs: the Order-Sorted Way
• An axiomatic basis for computer programming
• On calculational proofs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item