Dynamic Reductions for Model Checking Concurrent Software
DOI10.1007/978-3-319-52234-0_14zbMath1484.68102arXiv1611.09318OpenAlexW2551596431MaRDI QIDQ2961569
Georg Weissenbacher, Alfons W. Laarman, Henning Günther, Ana Sokolova
Publication date: 21 February 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.09318
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient partial order reduction algorithm with an alternative proviso implementation
- Exploiting object escape and locking information in partial-order reductions for concurrent object-oriented programs
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Dynamic Reductions for Model Checking Concurrent Software
- SAT-Based Model Checking without Unrolling
- Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
- Reduction
- Lazy abstraction
- A calculus of atomic actions
- Dynamic partial-order reduction for model checking software
- Proof-guided underapproximation-widening for multi-process systems
- Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis
- Peephole Partial Order Reduction
- Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions
- Lazy Abstraction with Interpolants
- Partial-order reduction in symbolic state-space exploration
This page was built for publication: Dynamic Reductions for Model Checking Concurrent Software
