Verification of Equivalent-Results Methods

DOI10.1007/978-3-540-78739-6_24zbMath1133.68377OpenAlexW1565805705MaRDI QIDQ5458406

Peter Müller, K. Rustan M. Leino

Publication date: 11 April 2008

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78739-6_24

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Integrating ADTs in KeY and their application to history-based reasoning about collection ⋮ Modular Verification of Procedure Equivalence in the Presence of Memory Allocation

Cites Work

• Unnamed Item
• Unnamed Item
• How the design of JML accommodates both runtime assertion checking and formal verification
• Separation and information hiding
• Separation logic and abstraction
• A Reachability Predicate for Analyzing Low-Level Software

This page was built for publication: Verification of Equivalent-Results Methods