Constructing compact models of concurrent Java programs
James C. Corbett · ACM SIGSOFT Software Engineering Notes · 1998
Finite-state verification technology (e.g., model checking) provides a powerful means to detect concurrency errors, which are often subtle and difficult to reproduce. Nevertheless, widespread use of this technology by developers is unlikely until tools provide automated support for extracting the required finite-state models directly from program source. In this paper, we explore the extraction of compact concurrency models from Java code. In particular, we show how static pointer analysis, which has traditionally been used for computing alias information in optimizers, can be used to greatly reduce the size of finite-state models of concurrent Java programs.
Cited by 3 works. doi:10.1145/271775.271778
Authors
References
- Checking that finite state concurrent programs satisfy their linear specification
- Proceedings of the 1999 International Conference on Parallel Processing
- Analysis of pointers and structures
- Data flow analysis for verifying properties of concurrent programs
- Automated analysis of concurrent systems with the constrained expression toolset
- Timing analysis of Ada tasking programs
- Using state space reduction methods for deadlock analysis in Ada tasking
- Static Infinite Wait Anomaly Detection in Polynomial Time
- Integrated concurrency analysis in a software development enviornment
- Elements of style