Modular model checking

DOI10.1007/3-540-49213-5_14MaRDI QIDQ7010069zbMATH OpenFDO

Authors Orna Kupferman, Moshe Y. Vardi

Publication date 19 March 2025

Full work available at URL https://doi.org/10.1007/3-540-49213-5_14

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Cites work

• scientific article; zbMATH DE number 4180789 (Why is no real title available?)
• scientific article; zbMATH DE number 3926220 (Why is no real title available?)
• scientific article; zbMATH DE number 3982506 (Why is no real title available?)
• scientific article; zbMATH DE number 4011921 (Why is no real title available?)
• scientific article; zbMATH DE number 3757688 (Why is no real title available?)
• Assumption/guarantee specifications in linear-time temporal logic (extended abstract)
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Decision procedures and expressiveness in the temporal logic of branching time
• Modalities for model checking: Branching time logic strikes back
• Proofs of Networks of Processes
• Reasoning about infinite computations
• Specifying Concurrent Program Modules
• The complexity of propositional linear temporal logics
• The temporal semantics of concurrent programs
• “Sometimes” and “not never” revisited

Cited in

(1)

• Automatic assume-guarantee reasoning for safety and liveness using passive learning

This page was built for publication: Modular model checking

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