A generic approach to the static analysis of concurrent programs with procedures

International Journal of Foundations of Computer Science

Volumn 14, Issue 4, 2003, Pages 551-582

  Bouajjani, Ahmed ^a   Esparza, Javier ^b   Touili, Tayssir ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b UNIVERSITY OF STUTTGART   (Germany)

Author keywords

abstraction; Concurrent programs with procedures; Kleene algebras; pushdown systems; static analysis; verification

Indexed keywords

EID: 26444574396     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054103001893     Document Type: Article

References (19)

1. J. Blieberger, B. Burgstaller, and B. Scholz. Symbolic Data Flow Analysis forDetecting Deadlocks in Ada Tasking Programs. In Proc. of the Ada-Europe InternationalConference on Reliable Software Technologies, Potsdam, Germany, 2000
2. A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Pushdown Automata:Application to Model Checking. In CONCUR'97, volume 1243 of LNCS,1997
3. J. C. Corbett. Automated Formal Analysis Methods for Concurrent and Real-TimeSoftware. PhD thesis, University of Massachusetts at Amherst, 1992
4. E. Duesterwald and M. Sofia. Concurrency analysis in the presence of of proceduresusing a data-flow framework. In Proc. of the Symposium on Testing, Analysis, andVerification, Victoria, Canada, ACM Press, 1991
5. M. B. Dwyer and L. A. Clarke. Data flow analysis for verifying properties ofconcurrent programs. In Proceedings of the ACM SIGSOFT '94 Symposium on theFoundations of Software Engineering, ACM Press, 1994
6. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithm formodel checking pushdown systems. In CAV'00, volume 1885 of LNCS, 2000
7. J. Esparza and J. Knoop. An automat a-theoretic approach to interprocedural dataflowanalysis. In W. Thomas, editor, Proc of Foundations of Software Science andComputation Structure, FoSSaCS'99, volume 1578 of Lecture Notes in ComputerScience. Springer, 1999
8. J. Esparza and A. Podelski. Efficient algorithms for pre and post on interproceduralparallel flow graphs. In Proceedings of the 27th ACM SIGPLAN-SIGACT onPrinciples of Programming Languages, POPL 2000, ACM Press, 2000
9. S. Ginsburg and E.H. Spanier. Semigroups, Presburger formulas and languages InPacific Journal of Mathematics, volume 16, 1966
10. M. Hopkins and D. Kozen. Parikh's Theorem in Commutative Kleene Algebra. InProc. IEEE Conf. Logic in Computer Science (LICS799). IEEE, 1999
11. D. Lugiez and P. Schnoebelen. The Regular Viewpoint on PA-processes. In TCS,volume 274(1-2), 2002
12. N. Mercouroff. An algorithm for analyzing communicating processes. In MathematicalFoundations of Programming Semantics, volume 598 of LNCS, 1991
13. G. Naumovich and G. Avrunin. A conservative data flow algorithm for detectingall pairs of statement that may happen in parallel. In Proceedings of the ACMSIGSOFT International Symposium on Foundations of Software Engineering, ACMPress, 1998
14. G. Ramalingam. Context-sensitive synchronization-sensitive analysis is undecidable.ACM Transactions on Programming Languages and Systems (TOPLAS), volume 22,2000
15. T. Reps, S. Schwoon and S. Jha. Weighted Pushdown Systems and Their Applicationto Interprocedural Dataflow Analysis To appear in: Proc. of the 10thInternational Symposium on Static Analysis, SAS 2003, 2003
16. M. Rinard. Analysis of multithreaded programs. In P. Cousot, editor, Proc. of the8th International Symposium on Static Analysis, SAS 2001, volume 2126 of LNCS,2001
17. S. Schwoon. Model Checking Pushdown Systems. Ph.D. Thesis, Technical Universityof Munich, 2002
18. R. Taylor. A general-purpose algorithm for analyzing concurrent programs. Communicationsof the ACM, volume 26, 1983
19. E. Yahav. Verifying safety properties of concurrent Java programs using 3-valuedlogic. ACM SIGPLAN Notices, volume 36(3), 2001.