Slicing communicating automata specifications: Polynomial algorithms for model reduction

DOI10.1007/s00165-008-0086-3zbMath1163.68028OpenAlexW2086859508MaRDI QIDQ1019005

Jean-Pierre Gallois, Sébastien Labbé

Publication date: 27 May 2009

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://tel.archives-ouvertes.fr/tel-00180174/file/These_Sebastien_Labbe.pdf

zbMATH Keywords

model reductionpolynomial algorithmsstatic analysisspecificationslicingcommunicating automatadataflow analysis

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Fast computation of strong control dependencies, Correctly Slicing Extended Finite State Machines, Dynamic Slicing of Petri Nets Based on Structural Dependency Graph and its Application in System Analysis

Uses Software

• AGATHA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic program slicing
• Issues in slicing PROMELA and its applications to model checking, protocol understanding, and simulation
• Symbolic Execution Techniques for Test Purpose Definition
• The program dependence graph and its use in optimization
• Global Data Flow Analysis and Iterative Algorithms
• On optimal slicing of parallel programs
• Programming Languages and Systems
• ZB 2005: Formal Specification and Development in Z and B