The decidability of verification under PS 2.0
From MaRDI portal
Publication:2233444
DOI10.1007/978-3-030-72019-3_1zbMath1474.68187OpenAlexW3138980809MaRDI QIDQ2233444
Adwait Godbole, Mohamed Faouzi Atig, Shankara Narayanan Krishna, Viktor Vafeiadis, Parosh Aziz Abdulla
Publication date: 18 October 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-72019-3_1
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (1)
Cites Work
- Tools and algorithms for the construction and analysis of systems. 23rd international conference, TACAS 2017, held as part of the European joint conferences on theory and practice of software, ETAPS 2017, Uppsala, Sweden, April 22--29, 2017. Proceedings. Part II
- Reducing concurrent analysis under a context bound to sequential analysis
- Verifying programs with unreliable channels
- The decidability of verification under PS 2.0
- A separation logic for a promising semantics
- Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
- Modular Relaxed Dependencies in Weak Memory Concurrency
- On the verification problem for weak memory models
- The Java memory model
- A promising semantics for relaxed-memory concurrency
- Delay-bounded scheduling
- Context-Bounded Analysis of Concurrent Queue Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- A variant of a recursively unsolvable problem
- Well-structured transition systems everywhere!
This page was built for publication: The decidability of verification under PS 2.0
