Improving the accuracy of Petri net-based analysis of concurrent programs

Authors:
A. T. Chamillard;Lori A. Clarke
Affiliations:
Department of Computer Science, University of Massachusetts, Amherst, Amherst, MA;Department of Computer Science, University of Massachusetts, Amherst, Amherst, MA
Venue:
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Year:
1996

Citing 17
Cited 3

Combining Static Concurrency Analysis with Symbolic Execution

IEEE Transactions on Software Engineering
A Petri net framework for automated analysis of Ada tasking behavior

Journal of Systems and Software
A general-purpose algorithm for analyzing concurrent programs

Communications of the ACM
Task interaction graphs for concurrency analysis

ICSE '89 Proceedings of the 11th international conference on Software engineering
Integrated concurrency analysis in a software development enviornment

TAV3 Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification
Data flow analysis of distributed communicating processes

International Journal of Parallel Programming
A model of Ada programs for static deadlock detection in polynomial times

PADD '91 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging
Automated Analysis of Concurrent Systems with the Constrained Expression Toolset

IEEE Transactions on Software Engineering
Non-concurrency analysis

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Data flow analysis for verifying properties of concurrent programs

SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
Application and experimental evaluation of state space reduction methods for deadlock analysis in Ada

ACM Transactions on Software Engineering and Methodology (TOSEM)
A compact Petri net representation for concurrent programs

Proceedings of the 17th international conference on Software engineering
Petri Nets

ACM Computing Surveys (CSUR)
Petri Net Theory and the Modeling of Systems

Petri Net Theory and the Modeling of Systems
Tractable Flow Analysis for Anomaly Detection in Distributed Programs

ESEC '93 Proceedings of the 4th European Software Engineering Conference on Software Engineering
Improving Static Analysis Accuracy on Concurrent Ada Progra: Complexity Results and Empirical Findings

Improving Static Analysis Accuracy on Concurrent Ada Progra: Complexity Results and Empirical Findings
Identical tasks and counter variables in an integer programming-based approach to verification

IWSSD '93 Proceedings of the 7th international workshop on Software specification and design

A Compact Petri Net Representation and Its Implications for Analysis

IEEE Transactions on Software Engineering
Causal dataflow analysis for concurrent programs

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Control flow analysis of UML 2.0 sequence diagrams

ECMDA-FA'05 Proceedings of the First European conference on Model Driven Architecture: foundations and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Spurious results are an inherent problem of most static analysis methods. These methods, in an effort to produce conservative results, overestimate the executable behavior of a program. Infeasible paths and imprecise alias resolution are the two causes of such inaccuracies. In this paper we present an approach for improving the accuracy of Petri net-based analysis of concurrent programs by including additional program state information in the Petri net. We present empirical results that demonstrate the improvements in accuracy and, in some cases, the reduction in the search space that result from applying this approach to concurrent Ada programs.