Syntactic reductions for efficient deadlock analysis

Software Testing Verification and Reliability

Volumn 12, Issue 3, 2002, Pages 173-186

  De Francesco, Nicoletta ^a   Santone, Antonella ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF SANNIO   (Italy)

Author keywords

CCS; Concurrent specifications; Deadlock; State explosion

Indexed keywords

AUTOMATA THEORY; BOOLEAN ALGEBRA; CONCURRENCY CONTROL; CONCURRENT ENGINEERING; DATA FLOW ANALYSIS; LOGIC PROGRAMMING; THEOREM PROVING;

COMMUNICATING SYSTEMS CALCULUS; CONCURRENT SYSTEMS; MODEL CHECKING; PROGRAM STRUCTURE; SYNTACTIC REDUCTIONS;

COMPUTER SOFTWARE SELECTION AND EVALUATION;

EID: 0036742341     PISSN: 09600833     EISSN: None     Source Type: Journal    
DOI: 10.1002/stvr.252     Document Type: Article

References (30)

1. Clarke EM, Emerson EA, Sistla AP. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 1986; 8(2):244-263.
2. Milner R. Communication and Concurrency. Prentice-Hall: Englewood Cliffs, NJ. 1989.
3. Bolognesi T, Brinksma E. Introduction to ISO specification language LOTOS. Computer Networks and ISDN Systems 1987; 14:25-59.
4. Cleaveland R, Sims S. The NCSU Concurrency Workbench. Proceedings of the Eighth International Conference on Computer-Aided Verification (CAV'96) (Lecture Notes in Computer Science, vol. 1102). Springer: Berlin, 1996; 394-397.
5. Fernandez JC, Garavel H, Kerbrat A, Mateescu R, Mounier L, Sighireanu M. CADP: A protocol validation and verification toolbox. Proceedings of the Third International Conference on Computer-Aided Verification (Lecture Notes in Computer Science, vol. 1102). Springer: Berlin, 1996; 437-440.
6. Barbuti R, De Francesco N, Santone A, Vaglini G. Selective mu-calculus and formula-based equivalence of transition systems. Journal of Computer and System Sciences 1999; 59(3):537-556.
7. Godefroid P. Partial-order Methods for the Verification of Concurrent Systems (Lecture Notes in Computer Science, vol. 1032). Springer: Berlin, 1996.
8. Mazzocca N, Santone A. Vaglini G, Vittorini V. Efficient model checking of properties of a distributed application: A multimedia case study. Software Testing, Verification & Reliability 2002: 12(1):3-21.
9. Stirling C, Walker D. Local model checking in the modal mu-calculus. Theoretical Computer Science 1991; 89(1):161-177.
10. Stirling C. An introduction to modal and temporal logics for CCS. Concurrency: Theory, Language, and Architecture (Lecture Notes in Computer Science, vol. 391). Springer: Berlin, 1989.
11. Taylor RN. Complexity of analyzing the synchronization structure of concurrent programs. Acta Informatica 1983; 19:57-84.
12. Koppol PV, Tai KC. An incremental approach to structural testing of concurrent software. Proceedings of the ACM International Symposium on Software, Testing and Analysis, 1996. Also published in ACM Software Engineering Notes 1996; 21(3):14-23.
13. 20 states and beyond. Proceedings Fifth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1990; 428-439.
14. Bryant RE. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers 1986; C-35(8):677-691.
15. Cleveland R. Tableau-based model checking in the propositional mu-calculus. Acta Informatica 1989; 27(8):725-747.
16. Fernandez JC, Mounier L. Verifying bisimulation on the fly. Third International Conference on Formal Description Techniques, (FORTE'90), Madrid, November 1990. North-Holland, 1990; 95-110.
17. Jard C, Jéron T. Bounded-memory algorithms for verification on-the-fly. Proceedings of the Third International Conference on Computer-Aided Verification (Lecture Notes in Computer Science, vol. 575). Springer: Berlin, 1991; 192-201.
18. Godefroid P, Wolper P. Using partial orders for efficient verification of deadlock freedom and safety properties. Proceedings of the Third International Conference on Computer-Aided Verification (CAV'91) (Lecture Notes in Computer Science, vol. 575). Springer: Berlin, 1991; 332-342.
19. Peled D. All from one, one for all, on model-checking using representatives. Proceedings of the Fifth International Conference on Computer-Aided Verification (CAV'93) (Lecture Notes in Computer Science, vol. 679). Springer: Berlin, 1993; 409-423.
20. Valmari A. A stubborn attack on state explosion. Proceedings of International Conference on Computer-Aided Verification (CAV'90) (Lecture Notes in Computer Science, vol. 531). Springer: Berlin, 1990: 156-165.
21. Corbett J. Evaluating deadlock detection methods for concurrent software. IEEE Transactions of Software Engineering 1996; 22(3):161-180.
22. Tai KC, Koppol PV. Hierarchy-based incremental analysis of communication protocols. Proceedings International Conference on Network Protocols. IEEE Press, 1993; 318-325.
23. Karacali B, Tai KC. Model checking based on simultaneous reachability analysis. Proceedings of the SPIN 2000 Conference on Model Checking of Computer Software (Lecture Notes in Computer Science, vol. 1885). Springer: Berlin, 2000; 34-53.
24. Bruns G. A practical technique for process abstraction. Proceedings of the Fourth International Conference on Concurrency Theory (CONCUR'93) (Lecture Notes in Computer Science, vol. 714). Springer: Berlin, 1993; 37-49.
25. Clarke EM. Grumberg O, Long DE. Model checking and abstraction. ACM Transactions on Programming Languages and Systems 1994; 16(5):1512-1542.
26. Bensalem S, Bouajjani A, Loiseaux C, Sifakis J. Property preserving simulations. Proceedings of the Fourth Workshop on Computer Aided Verification (CAV'92)(Lecture Notes in Computer Science, vol. 663). Springer: Berlin, 1992; 260-273.
27. Sifakis J. Property preserving homomorphisms of transition systems. Logics of Programs (Lecture Notes in Computer Science, vol. 164). Srpinger: Berlin, 1983; 458-473.
28. Rondogiannis P, Cheng MHM. Peri-net-based deadlock analysis of process algebra programs. Science of Computer Programming 1994, 23(1):55-89.
29. Reisig W. Petri nets. EATCS Monographs on Theoretical Computer Science 1985; 4.
30. De Francesco N, Santone A, Vaglini G. State space reduction by non-standard semantics for deadlock analysis. Science of Computer Programming 1998; 30(3):309-338.