Parameterized model checking on the TSO weak memory model
From MaRDI portal
Publication:2208293
Recommendations
Cites work
- scientific article; zbMATH DE number 3767012 (Why is no real title available?)
- Backward reachability of array-based systems by SMT solving: termination and invariant synthesis
- Checking and enforcing robustness against TSO
- Cubicle-\(\mathcal{W}\): parameterized model checking on weak memory
- Fundamental approaches to software engineering. 18th international conference, FASE 2015, held as part of the European joint conferences on theory and practice of software, ETAPS 2015, London, UK, April 11--18, 2015. Proceedings
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- MCMT: a model checker modulo theories
- Parameterized Verification of Infinite-State Processes with Global Conditions
- Reasoning about networks with many identical finite state processes
- Reasoning about systems with many processes
- Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)
- Software verification for weak memory via program transformation
- The benefits of duality in verifying concurrent programs under TSO
Cited in
(5)- Declarative parameterized verification of distributed protocols via the Cubicle model checker
- Sound verification procedures for temporal properties of infinite-state systems
- Parameterized verification under TSO with data types
- Cubicle-\(\mathcal{W}\): parameterized model checking on weak memory
- The benefits of duality in verifying concurrent programs under TSO
This page was built for publication: Parameterized model checking on the TSO weak memory model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2208293)