Sufficient Preconditions for Modular Assertion Checking

DOI10.1007/978-3-540-78163-9_18MaRDI QIDQ5452717zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Context-Sensitive Multivariant Assertion Checking in Modular Programs
• Counterexample-guided precondition inference
• Assertion Checking Unified
• Sound modular verification of C code executing in an unverified context
• Modular inference of subprogram contracts for safety checking

Cited in

(9)

• Sound modular verification of C code executing in an unverified context
• Precondition inference from intermittent assertions and application to contracts on collections
• Inferring Min and Max Invariants Using Max-Plus Polyhedra
• Inferring sufficient conditions with backward polyhedral under-approximations
• Counterexample-guided precondition inference
• Context-Sensitive Multivariant Assertion Checking in Modular Programs
• Assertion Checking Unified
• Transformation-Enabled Precondition Inference
• Verified runtime assertion checking for memory properties

Describes a project that uses

Uses Software

• Caduceus
• Boogie

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

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