An invariant-based approach to the verification of asynchronous parameterized networks

DOI10.1016/j.jsc.2008.11.006zbMath1208.68148OpenAlexW2143812611MaRDI QIDQ604385

Sumit K. Garg

Publication date: 10 November 2010

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2008.11.006

zbMATH Keywords

simulationmodel checkinginductionprogram verificationinvariant generationasynchronous networks

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Game-theoretic simulation checking tool

Uses Software

• BLAST
• SPIN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing finite Kripke structures in propositional temporal logic
• Verification by augmented finitary abstraction
• A minimized automaton representation of reachable states
• A structural induction theorem for processes
• An approach to the verification of symmetric parameterized distributed systems
• Reasoning about systems with many processes
• Computer Science Logic
• CONCUR 2004 - Concurrency Theory
• On Reasoning About Rings
• FM 2005: Formal Methods
• Correct Hardware Design and Verification Methods

This page was built for publication: An invariant-based approach to the verification of asynchronous parameterized networks