Constructing compact models of concurrent Java programs

Proceedings of the 1998 ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 1998

Volumn , Issue , 1998, Pages 1-10

  Corbett, James C ^a  

^a University of Hawai'i at Manoa   (United States)

Author keywords

Finite state verification; Static analysis model extraction

Indexed keywords

COMPUTER SOFTWARE; EXTRACTION; MODEL CHECKING; SOFTWARE TESTING; STATIC ANALYSIS;

ANALYSIS MODELS; AUTOMATED SUPPORT; COMPACT MODEL; CONCURRENCY ERRORS; CONCURRENT JAVA PROGRAMS; FINITE STATE VERIFICATION; FINITE-STATE MODELS; POINTER ANALYSIS;

JAVA PROGRAMMING LANGUAGE;

EID: 84948125031     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/271771.271778     Document Type: Conference Paper

References (14)

1. E. Ashcroft and Z. Manna. Formalization of properties of parallel programs. Machine Intelligence, 6:17-41, 1971.
2. G. S. Avrunin, U. A. Buy, J. C. Corbett, L. K. Dillon, and J. C. Wileden. Automated analysis of concurrent systems with the constrained expression toolset. IEEE Trans. Softw. Eng., 17(11):1204-1222, Nov. 1991.
3. T. Bultan, J. Fisher, and R. Gerber. Compositional verification by model checking for counter examples. In Ziel [14], pages 224-238.
4. D. R. Chase, M. Wegman, and F. K. Zadeck. Analysis of pointers and structures. In Proceedings of the ACM SIGPLAN'90 Conference on Programming Language Design and Implementation (PLDI), pages 296310, June 1990.
5. J. C. Corbett. Timing analysis of Ada tasking programs. IEEE Trans. Softw. Eng., 22(7):461-483, 1996.
6. D. L. Dill, A. J. Drexler, A. J. Hu, and C. H. Yang. Protocol verification as a hardware design aid. In IEEE International Conference on Computer Design, October 1992.
7. S. Duri, U. Buy, R. Devarapalli, and S. M. Shatz. Using state space reduction methods for deadlock analysis in Ada tasking. In T. Ostrand and E. Weyuker, editors, Proceedings of the 1993 International Symposium on Software Testing and Analysis (ISSTA), pages 51-60, New York, June 1993. ACM Press.
8. M. B. Dwyer and L. A. Clarke. Data flow analysis for verifying properties of concurrent programs. In D. Wile, editor, Proceedings of the Second Symposium on Foundations of Software Engineering, pages 62-75, Dec. 1994.
9. D. Jackson and C. A. Damon. Elements of style: Analyzing a software design feature with a counterexample detector. In Ziel [14], pages 239-249.
10. D. Lea. Concurrent Programming in Java: Design Principles and Patterns. Addison-Wesley, Reading, Massachusetts, 1997.
11. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specifications. In Proceedings of the Twelfth ACM Symposium on the Priciples of Programming Languages, pages 97105, 1985.
12. S. P. Masticola and B. G. Ryder. Static infinite wait anomaly detection in polynomial time. In Proceedings of the 1990 International Conference on Parallel Processing, volume II, pages 78-87, 1990.
13. M. Young, R. N. Taylor, K. Forester, and D. Bredbeck. Integrated concurrency analysis in a software development environment. In R. A. Kemmerer, editor, Proceedings of the ACM SIGSOFT '89 Third Symposium on Software Testing, Analysis and Verification, pages 200-209, 1989. Appeared as Software Engineering Notes, 14(8).
14. S. Ziel, editor. Proceedings of the 1996 International Symposium on Software Testing and Analysis (ISSTA). ACM Press, January 1996.