Sufficient Preconditions for Modular Assertion Checking

DOI10.1007/978-3-540-78163-9_18zbMath1138.68455OpenAlexW1517409399MaRDI QIDQ5452717

Yannick Moy

Publication date: 4 April 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-78163-9_18

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Transformation-Enabled Precondition Inference ⋮ Inferring Min and Max Invariants Using Max-Plus Polyhedra ⋮ Inferring Sufficient Conditions with Backward Polyhedral Under-Approximations ⋮ Precondition Inference from Intermittent Assertions and Application to Contracts on Collections

Uses Software

• Caduceus
• Boogie

This page was built for publication: Sufficient Preconditions for Modular Assertion Checking