Constraint-based automatic verification of abstract models of multithreaded programs

Theory and Practice of Logic Programming

Volumn 7, Issue 1-2, 2007, Pages 67-91

  Delzanno, Giorgio ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

Constraints; Multithreaded programs; Verification

Indexed keywords

COMPUTER SOFTWARE; HIGH LEVEL LANGUAGES; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SYNTACTICS;

ABSTRACT MODELS; MULTITHREADED PROGRAMS; SPECIFICATION LANGUAGE; VERIFICATION;

CONSTRAINT THEORY;

EID: 33847023547     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068406002821     Document Type: Conference Paper

References (18)

1. ABDULLA, P. A., CERĀNS, K., JONSSON, B., AND TSAY, Y.-K. 1996. General Decidability Theorems for Infinite-State Systems. In Proceedings 11th Annual International Symposium on Logic in Computer Science (LICS'96), IEEE Computer Society Press, New Brunswick, New Jersey, 313-321.
2. ABDULLA, P. A. AND JONSSON, B. 2001. Ensuring Completeness of Symbolic Verification Methods for Infinite-State Systems. Theoretical Computer Science 256, 1-2, 145-167.
3. ABDULLA, P. A. AND JONSSON, B. 2003. Model checking of systems with many identical timed processes. Theoretical Computer Science 290, 1, 241-264.
4. ABDULLA, P. A. AND NYLÉN, A. 2000. Better is Better than Well: On Efficient Verification of Infinite-State Systems. In Proceedings 15th Annual International Symposium on Logic in Computer Science (LICS'00), IEEE Computer Society Press, Santa Barbara, California, 132-140.
5. BALL, T., CHAKI, S., AND RAJAMANI, S. K. 2001. Parameterized Verification of Multithreaded Software Libraries. In 7th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS 2001), Genova, Italy, April 2-6,. LNCS, vol. 2031. Springer-Verlag, 158-173.
6. BISTARELLI, S., CERVESATO, I., LENZINI, G., AND MARTINELLI, F. 2005. Relating multiset rewriting and process algebras for security protocol analysis. Journal of Computer Security 13, 1, 3-47.
7. BOCHMANN, G. V. 1978. Finite state descriptions of communicating protocols. Computer Networks 2, 46-57.
8. BOUAJJANI, A., JONSSON, B., NILSSON, M., AND TOUILI, T. 2000. Regular Model Checking. In Proceedings 12th International Conference on Computer Aided Verification (CAV'00), E. A. Emerson and A. P. Sistla, Eds. LNCS, vol. 1855. Springer-Verlag, Chicago, Illinois, 403-418.
9. BOZZANO, M. AND DELZANNO, G. 2002. Algorithmic verification of invalidation-based protocols. In 14th International Conference on Computer Aided Verification, CAV '02. Lecture Notes in Computer Science, vol. 2404. Springer.
10. CERVESATO, I., DURGIN, N., LINCOLN, P., MITCHELL, J., AND SCEDROV, A. 1999. A Meta-notation for Protocol Analysis. In 12th Computer Security Foundations Workshop (CSFW99). IEEE Computer Society Press, Mordano, Italy, 55-69.
11. DELZANNO, G. 2001. An Assertional Language for Systems Parametric in Several Dimensions. In VERIFICATION OF PARAMETERIZED SYSTEMS - VEPAS 2001. ENTCS, vol. 50.
12. DELZANNO, G. 2005. Constraint Multiset Rewriting. Tech. Rep. TR-05-08, Dipartimento Informatica e Scienze deU'Informazione, Università di Genova, Italia.
13. DELZANNO, G. AND PODELSKI, A. 1999. Model checking in CLP. In Proeedings 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'99). Lecture Notes in Computer Science, vol. 1579. Springer-Verlag, Amsterdam, The Netherlands, 223-239.
14. FINKEL, A. AND SCHNOEBELEN, P. 2001. Well-Structured Transition Systems Everywhere! Theoretical Computer Science 256, 1-2, 63-92.
15. GERMAN, S. M. AND SISTLA, A. P. 1992. Reasoning about Systems with Many Processes. Journal of the ACM 39, 3, 675-735.
16. GORDON, A. D. 2001. Notes on nominal calculi for security and mobility. In Foundations of Security Analysis and Design, Tutorial Lectures. Lecture Notes in Computer Science, vol. 2171. Springer, 262-330.
17. KESTEN, Y., MALER, O., MARCUS, M., PNUELI, A., AND SHAHAR, E. 2001. Symbolic model checking with rich assertional languages. Theoretical Computer Science 256, 1, 93-112.
18. SCHNOEBELEN, P. 2002. Verifying Lossy Channel Systems has Nonprimitive Recursive Complexity. Information Processing Letters 83, 5, 251-261.