Weak arithmetic completeness of object-oriented first-order assertion networks

DOI10.1007/978-3-642-35843-2_19MaRDI QIDQ2927647zbMATH OpenOpenAlexFDO

Authors Stijn De Gouw, Wolfgang Ahrendt, Richard Bubel, Frank S. de Boer

Publication date 4 November 2014

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

Full work available at URL https://doi.org/10.1007/978-3-642-35843-2_19

Mathematics Subject Classification ID

Logic in computer science (03B70) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Completeness of Hoare logic relative to the standard model
• Verification of object-oriented programs: a transformational approach
• A completeness theorem for dynamic logic
• A proof outline logic for object-oriented programming
• Inductive completeness of logics of programs

This page was built for publication: Weak arithmetic completeness of object-oriented first-order assertion networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2927647)