Verification of configurable SRA systems

DOI10.1007/978-3-032-32592-1_17MaRDI QIDQ7411313zbMATH OpenFDO

Authors Alessandro Cimatti, Alberto Griggio, Christian Lidström, Gianluca Redondi, Dylan Trenti

Publication date 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-032-32592-1_17

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites work

• An active learning approach to synthesizing program contracts
• Dafny: an automatic program verifier for functional correctness
• Eager abstraction for symbolic model checking
• Formal methods for open object-based distributed systems. 10th IFIP WG 6.1 international conference, FMOODS 2008, Oslo, Norway, June 4--6, 2008. Proceedings
• Formal verification of a railway interlocking system using model checking
• Invariant checking for SMT-based systems with quantifiers
• Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems
• Software model checking with explicit scheduler and symbolic threads
• Software Product Line Engineering

This page was built for publication: Verification of configurable SRA systems

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