Compositional Verification of Asynchronous Concurrent Systems using CADP

Autor: Radu Mateescu, Frédéric Lang, Hubert Garavel
Přispěvatelé: Construction of verified concurrent systems (CONVECS), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)
Jazyk: angličtina
Rok vydání: 2015
Předmět:
Model checking
Concurrency theory
Computer Networks and Communications
Principle of compositionality
Computer science
Process calculus
Concurrency
Verificati
Formal method
Temporal logic
0102 computer and information sciences
02 engineering and technology
[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]
computer.software_genre
01 natural sciences
[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.3: Formal methods
0202 electrical engineering
electronic engineering
information engineering
Bisimulation
Network of automata
Partial model checking
Semi-composition
Programming language
Mu-calcu lus
Process algebra
[INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
020207 software engineering
Projection interface
Formal methods
Labeled Transition System
ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.4: Model checking
Model minimization
010201 computation theory & mathematics
Asynchronous communication
ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.8: Validation
Model generation
computer
Software
Information Systems
Zdroj: Acta Informatica
Acta Informatica, Springer Verlag, 2015, 52 (4), pp.56. ⟨10.1007/s00236-015-0226-1⟩
Acta Informatica, 2015, 52 (4), pp.56. ⟨10.1007/s00236-015-0226-1⟩
ISSN: 0001-5903
1432-0525
DOI: 10.1007/s00236-015-0226-1⟩
Popis: International audience; During the last decades, concurrency theory successfully developed salient concepts to formally model and soundly reason about distributed and parallel systems. In practice, however, most attempts at analyzing large systems face severe complexity issues, especially state explosion, which prevents to exhaustively enumerate reachable state spaces. Compositionality is the most promising approach to fight state explosion. In this article, we focus on finite-state verification techniques for asynchronous message-passing systems, highlighting the existence of multiple, diverse compositional techniques such as: compositional model generation, semi-composition and projection, automatic generation of projection interfaces, formula-dependent model generation, and partial model checking. These approaches have been implemented in the framework of the CADP (Construction and Analysis of Distributed Processes) software toolbox and applied to large-scale, industrial systems. A key point is the ability to combine several compositional techniques, as no single technique is sufficient to address all kinds of systems.
Databáze: OpenAIRE
Externí odkaz: