On Symbolic Verification of Weakly Extended PAD

DOI10.1016/j.entcs.2006.10.053zbMath1277.68133OpenAlexW4301138892MaRDI QIDQ2866343

Tayssir Touili, Ahmed Bouajjani, Jan Strejček

Publication date: 13 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.10.053

zbMATH Keywords

model checkinginfinite-state systemsrewrite systemssymbolic reachability analysis

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Process rewrite systems.
• Decidability of model checking for infinite-state concurrent systems
• Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• CONCUR 2004 - Concurrency Theory
• Tools and Algorithms for the Construction and Analysis of Systems
• Term Rewriting and Applications
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Deciding bisimulation-like equivalences with finite-state processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Symbolic Verification of Weakly Extended PAD