Verification, Model Checking, and Abstract Interpretation
From MaRDI portal
Publication:5711509
DOI10.1007/b105073zbMath1111.68495OpenAlexW2611288859MaRDI QIDQ5711509
Publication date: 6 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b105073
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (8)
Synthesis of large dynamic concurrent programs from dynamic specifications ⋮ Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving ⋮ Deadlock-freedom in component systems with architectural constraints ⋮ The Automatic Detection of Token Structures and Invariants Using SAT Checking ⋮ Robustness in Interaction Systems ⋮ Mitigating Multi-target Attacks in Hash-Based Signatures ⋮ Finite-state concurrent programs can be expressed in pairwise normal form ⋮ Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems
This page was built for publication: Verification, Model Checking, and Abstract Interpretation
