Verification of concurrent programs using Petri net unfoldings
From MaRDI portal
Publication:2234071
DOI10.1007/978-3-030-67067-2_9zbMath1472.68087OpenAlexW3121117370MaRDI QIDQ2234071
Andreas Podelski, Matthias Heizmann, Daniel Dietsch, Claus Schätzle, Mehdi Naouar, Dominik Klumpp
Publication date: 18 October 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-67067-2_9
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Verification of sequential and concurrent programs
- An improvement of McMillan's unfolding algorithm
- Inductive data flow graphs
- Verification of parameterized concurrent programs by modular reasoning about data and control
- Static Analysis of Run-Time Errors in Embedded Critical Parallel C Programs
- Verification of Concurrent Programs Using Trace Abstraction Refinement
- Thread Quantification for Concurrent Shape Analysis
- Software Verification for Weak Memory via Program Transformation
- Predicate abstraction and refinement for verifying multi-threaded programs
- Computer Aided Verification
- Automated hypersafety verification
This page was built for publication: Verification of concurrent programs using Petri net unfoldings