Symbolic Counter Abstraction for Concurrent Software
From MaRDI portal
Publication:3636854
DOI10.1007/978-3-642-02658-4_9zbMath1242.68055OpenAlexW1586035363MaRDI QIDQ3636854
Gérard Basler, Michele Mazzucchi, Thomas Wahl, Daniel Kroening
Publication date: 30 June 2009
Published in: Computer Aided Verification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02658-4_9
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
SAT-Based Model Checking, Context-aware counter abstraction, Modeling and efficient verification of wireless ad hoc networks, Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy, \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms, Multi-scale verification of distributed synchronisation, Analysis of correct synchronization of operating system components, Finding cut-offs in leaderless rendez-vous protocols is easy, On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
Uses Software
