REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION
From MaRDI portal
Publication:3526545
DOI10.1142/S0129054108006066zbMath1162.68477OpenAlexW1974390918MaRDI QIDQ3526545
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Proving correctness of imperative programs by linearizing constrained Horn clauses ⋮ On one application of computations with oracle ⋮ Ping-pong protocols as prefix grammars: modelling and verification via program transformation ⋮ MONOTONIC ABSTRACTION: ON EFFICIENT VERIFICATION OF PARAMETERIZED SYSTEMS
Uses Software
Cites Work
- Unnamed Item
- Deforestation: Transforming programs to eliminate trees
- Constraint-based verification of parameterized cache coherence protocols
- Decidability of model checking for infinite-state concurrent systems
- Verification as a parameterized testing (experiments with the SCP4 supercompiler)
- The concept of a supercompiler
- A positive supercompiler
This page was built for publication: REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION
