Monotonic Abstraction in Parameterized Verification
From MaRDI portal
Publication:4982082
DOI10.1016/j.entcs.2008.12.027zbMath1337.68164MaRDI QIDQ4982082
Publication date: 23 March 2015
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.027
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
Cites Work
- A closed-form evaluation for Datalog queries with integer (gap)-order constraints
- Verifying programs with unreliable channels
- Monotonic Abstraction for Programs with Dynamic Memory Heaps
- Parameterized Verification of Infinite-State Processes with Global Conditions
- Handling Parameterized Systems with Non-atomic Global Conditions
- Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)
- Ordering by Divisibility in Abstract Algebras
- Computer Aided Verification
- Symbolic model checking with rich assertional languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item