Compositional analysis for verification of parameterized systems

DOI10.1016/j.tcs.2005.11.016zbMath1088.68100OpenAlexW1973289396MaRDI QIDQ2368952

Samik Basu, C. R. Ramakrishnan

Publication date: 28 April 2006

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.11.016

zbMATH Keywords

AccelerationParameterized systemsCompositional model checkingFormula equivalenceWidening

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)

Uses Software

• SPIN
• CESAR

Cites Work

• Results on the propositional \(\mu\)-calculus
• A linear-time model-checking algorithm for the alternation-free modal mu- calculus
• Control and data abstraction: The cornerstones of practical formal verification
• Parameterized verification of linear networks using automata as invariants
• Grammar Analysis and Parsing by Abstract Interpretation
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• The Complexity of Tree Automata and Logics of Programs
• Type analysis of prolog using type graphs
• On Reasoning About Rings
• Computer Aided Verification
• Automatic verification of parameterized networks of processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item