REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION
From MaRDI portal
Publication:3526545
Recommendations
- Solving Coverability Problem for Monotonic Counter Systems by Supercompilation
- Verification as a parameterized testing (experiments with the SCP4 supercompiler)
- scientific article; zbMATH DE number 1956590
- Reachability as derivability, finite countermodels and verification
- Compositional analysis for verification of parameterized systems
Cites work
- scientific article; zbMATH DE number 236855 (Why is no real title available?)
- A positive supercompiler
- Constraint-based verification of parameterized cache coherence protocols
- Decidability of model checking for infinite-state concurrent systems
- Deforestation: Transforming programs to eliminate trees
- The concept of a supercompiler
- Verification as a parameterized testing (experiments with the SCP4 supercompiler)
Cited in
(7)- Solving Coverability Problem for Monotonic Counter Systems by Supercompilation
- MONOTONIC ABSTRACTION: ON EFFICIENT VERIFICATION OF PARAMETERIZED SYSTEMS
- Ping-pong protocols as prefix grammars: modelling and verification via program transformation
- On one application of computations with oracle
- Proving correctness of imperative programs by linearizing constrained Horn clauses
- Program specialization as a tool for solving word equations
- Verification as a parameterized testing (experiments with the SCP4 supercompiler)
This page was built for publication: REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3526545)
