a public good project by the
Synthesis
Company
of California

© 2026

Deciding the Verification Problem for Abstract State Machines | doi.page

0 citations0 references

Google Scholar doi.org

Deciding the Verification Problem for Abstract State Machines

Lecture notes in computer science·2003·pp. 341–355

Related Papers

→ Variant-Based Satisfiability in Initial Algebras(2016)11 cited
→ On the Satisfiability Problem of Patterns in SPARQL 1.1(2018)5 cited
→ Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures(2006)42 cited
→ Decidability of a Hybrid Duration Calculus(2007)11 cited
Decidability and undecidability results for Nelson-Oppen and rewrite-based decision procedures(2006)