A structural induction theorem for processes

DOI10.1006/inco.1995.1024zbMath0828.68096OpenAlexW2048880957MaRDI QIDQ1891157

Robert Kurshan, K. L. McMillan

Publication date: 28 May 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1024

zbMATH Keywords

formal verificationcalculus of communicating systemsfinite state systemsstructural induction theorem

Mathematics Subject Classification ID

Related Items (19)

Model checking and abstraction to the aid of parameterized systems (a survey) ⋮ On process equivalence = equation solving in CCS ⋮ Feature interaction detection by pairwise analysis of LTL properties -- A case study ⋮ An invariant-based approach to the verification of asynchronous parameterized networks ⋮ Learning Meets Verification ⋮ Multi-parameterised compositional verification of safety properties ⋮ An automatic abstraction technique for verifying featured, parameterised systems ⋮ Verification of parametric concurrent systems with prioritised FIFO resource management ⋮ Verifying a Network Invariant for All Configurations of the Futurebus+ Cache Coherence Protocol ⋮ Networks of Processes with Parameterized State Space ⋮ Symbolic model checking with rich assertional languages ⋮ Automatic verification of parameterized networks of processes ⋮ An approach to the verification of symmetric parameterized distributed systems ⋮ The parallel composition of uniform processes with data ⋮ Verifying Parameterized taDOM+ Lock Managers ⋮ A novel approach to verifying context free properties of programs ⋮ Network invariants for real-time systems ⋮ Model checking of systems with many identical timed processes ⋮ Automated formal analysis and verification: an overview

This page was built for publication: A structural induction theorem for processes