Automatic verification of concurrent systems using a formula-based compositional approach

DOI10.1007/S00236-002-0084-5MaRDI QIDQ1403320zbMATH OpenOpenAlexFDO

Authors Antonella Santone

Publication date 1 September 2003

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-002-0084-5

zbMATH Keywords

transition systems

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)

Recommendations

• A FORMULA-DRIVEN MODULAR ATTACK ON STATE EXPLOSION
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• scientific article; zbMATH DE number 1746446
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Refined Interfaces for Compositional Verification

Cited in

(14)

• How to verify and exploit a refinement of component-based systems
• Formal verification of concurrent systems via directed model checking
• scientific article; zbMATH DE number 734956 (Why is no real title available?)
• Compositional verification for timed systems based on automatic invariant generation
• A FORMULA-DRIVEN MODULAR ATTACK ON STATE EXPLOSION
• Automatic and hierarchical verification for concurrent systems
• Testing Systems of Concurrent Black-Boxes—An Automata-Theoretic and Decompositional Approach
• scientific article; zbMATH DE number 1746446 (Why is no real title available?)
• On the role of automated theorem proving in the compile-time derivation of concurrency
• Refined Interfaces for Compositional Verification
• Compositional verification of asynchronous concurrent systems using CADP
• Compositional verification of concurrent systems by combining bisimulations
• Using heuristic search for finding deadlocks in concurrent systems
• Projecting transition systems: overcoming state explosion in concurrent system verification

Describes a project that uses

Uses Software

• LOTOS
• MOCHA

This page was built for publication: Automatic verification of concurrent systems using a formula-based compositional approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1403320)