Slicing communicating automata specifications: Polynomial algorithms for model reduction
type: Item
instance of: scholarly article
title: Slicing communicating automata specifications: Polynomial algorithms for model reduction
zbMATH Open document ID: 1163.68028
author: Sébastien Labbé
author: Jean-Pierre Gallois
published in: Formal Aspects of Computing
publication date: 2009-05-27T00:00:00Z
full work available at URL: These Sebastien Labbe.pdf
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5558108
zbMATH Keywords: slicing
zbMATH Keywords: model reduction
zbMATH Keywords: specification
zbMATH Keywords: communicating automata
zbMATH Keywords: static analysis
zbMATH Keywords: dataflow analysis
zbMATH Keywords: polynomial algorithms
describes a project that uses: AGATHA
MaRDI profile type: Publication
OpenAlex ID: W2086859508
cites work: Q4162673
cites work: Q4417966
cites work: ZB 2005: Formal Specification and Development in Z and B
cites work: The program dependence graph and its use in optimization
cites work: Symbolic Execution Techniques for Test Purpose Definition
cites work: Q4133096
cites work: Dynamic program slicing
cites work: Global Data Flow Analysis and Iterative Algorithms
cites work: On optimal slicing of parallel programs
cites work: Issues in slicing PROMELA and its applications to model checking, protocol understanding, and simulation
cites work: Q4255591
cites work: Programming Languages and Systems
cites work: Q4412530
DOI: 10.1007/S00165-008-0086-3
description: scientific article; zbMATH DE number 5558108