Dependency Analysis for Control Flow Cycles in Reactive Communicating Processes

Authors:
Stefan Leue;Alin Ştefănescu;Wei Wei
Affiliations:
Department of Computer and Information Science, University of Konstanz, Konstanz, Germany D-78457;SAP Research CEC Darmstadt, , Darmstadt, Germany D-64283;Department of Computer and Information Science, University of Konstanz, Konstanz, Germany D-78457
Venue:
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Year:
2008

Citing 16
Cited 1

The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
Non-concurrency analysis

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Using integer programming to verify general safety and liveness properties

Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Efficient distributed implementation of semi-replicated synchronous groupware

Proceedings of the 9th annual ACM symposium on User interface software and technology
A conservative data flow algorithm for detecting all pairs of statements that may happen in parallel

SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
On Communicating Finite-State Machines

Journal of the ACM (JACM)
Improving the Precision of INCA by Eliminating Solutions with Spurious Cycles

IEEE Transactions on Software Engineering
Compiling for instruction cache performance on a multithreaded architecture

Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture
A new foundation for control dependence and slicing for modern program structures

ACM Transactions on Programming Languages and Systems (TOPLAS) - Special Issue ESOP'05
Spin model checker, the: primer and reference manual

Spin model checker, the: primer and reference manual
BEEM: benchmarks for explicit model checkers

Proceedings of the 14th international SPIN conference on Model checking software
Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Termination of polynomial programs

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Counterexample-based refinement for a boundedness test for CFSM languages

SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Abstraction refinement for termination

SAS'05 Proceedings of the 12th international conference on Static Analysis
A livelock freedom analysis for infinite state asynchronous reactive systems

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory

Static livelock analysis in CSP

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The execution of a reactive system amounts to the repetitions of executions of control flow cycles in the component processes of the system. The way in which cycle executions are combined is not arbitrary since cycles may depend on or exclude one another. We believe that the information of such dependencies is important to the design, understanding, and verification of reactive systems. In this paper, we formally define the concept of a cycle dependency, and propose several static analysis methods to discover such dependencies. We have implemented several strategies for computing cycle dependencies and compared their performance with realistic models of considerable size. It is also shown how the detection of accurate dependencies is used to improve a livelock freedom analysis that we developed previously.