Regular Model Checking using Widening Techniques

DOI10.1016/S1571-0661(04)00187-2zbMath1262.68130OpenAlexW1971521983MaRDI QIDQ4921501

Tayssir Touili

Publication date: 10 May 2013

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

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)00187-2

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (13)

Regular model checking with regular relations ⋮ Model Checking Parameterized Systems ⋮ Learning to verify branching time properties ⋮ Permutation rewriting and algorithmic verification ⋮ Unnamed Item ⋮ Efficiency of automata in semi-commutation verification techniques ⋮ Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates ⋮ Regular Model Checking using Widening Techniques ⋮ View abstraction for systems with component identities ⋮ Reachability Games on Automatic Graphs ⋮ Bottom-Up Shape Analysis ⋮ Iterating transducers ⋮ Parameterised verification for multi-agent systems

Uses Software

• MONA

Cites Work

• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• Permutation rewriting and algorithmic verification
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• Regular Model Checking using Widening Techniques
• On Reasoning About Rings
• Symbolic model checking with rich assertional languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Regular Model Checking using Widening Techniques