REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION
From MaRDI portal
Publication:3526545
DOI10.1142/S0129054108006066zbMATH Open1162.68477OpenAlexW1974390918MaRDI QIDQ3526545FDOQ3526545
Authors: A. P. Nemytykh, Alexej P. Lisitsa 
Publication date: 25 September 2008
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054108006066
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
- The concept of a supercompiler
- Title not available (Why is that?)
- Deforestation: Transforming programs to eliminate trees
- Decidability of model checking for infinite-state concurrent systems
- Verification as a parameterized testing (experiments with the SCP4 supercompiler)
- A positive supercompiler
- Constraint-based verification of parameterized cache coherence protocols
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)
Uses Software
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)
