PBMC: Symbolic Slicing for the Verification of Concurrent Programs

DOI10.1007/978-3-319-24953-7_26MaRDI QIDQ3460578zbMATH OpenOpenAlexFDO

Authors Habib Saissi, Péter Bokor, Neeraj Suri

Publication date 8 January 2016

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-24953-7_26

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Verifying Concurrent Systems with Symbolic Execution
• Interactive verification of concurrent systems using symbolic execution
• Verification of fine-grain concurrent programs
• scientific article; zbMATH DE number 1390245
• Verification of parameterized concurrent programs by modular reasoning about data and control
• Verification of concurrent programs using trace abstraction refinement

Cited in

(1)

• Proof-Guided Underapproximation Widening for Bounded Model Checking

This page was built for publication: PBMC: Symbolic Slicing for the Verification of Concurrent Programs

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