Continuous reasoning: scaling the impact of formal methods

DOI10.1145/3209108.3209109MaRDI QIDQ5145272zbMATH OpenOpenAlexFDO

Authors Peter W. O'Hearn

Publication date 20 January 2021

Published in Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3209108.3209109

zbMATH Keywords

continuous integrationreasoning

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Recommendations

• The process semantics based reasoning about continuous change
• Scalable Techniques for Formal Verification
• scientific article; zbMATH DE number 1497771
• Mathematics and Software Verification
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing

Cited in

(10)

• Bridging arrays and ADTs in recursive proofs
• Incremental Abstract Interpretation
• scientific article; zbMATH DE number 7455716 (Why is no real title available?)
• Limits and difficulties in the design of under-approximation abstract domains
• Symbolic computation in automated program reasoning
• Rethinking static analysis by combining discrete and continuous reasoning
• A correctness and incorrectness program logic
• Induction in saturation
• Higher-order constrained dependency pairs for (universal) computability
• Verified cryptographic code for everybody

This page was built for publication: Continuous reasoning: scaling the impact of formal methods

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