Rewriting systems with data a framework for reasoning about systems with unbounded structures over infinite data domains

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4639 LNCS, Issue , 2007, Pages 1-22

  Bouajjani, Ahmed ^a   Habermehl, Peter ^a,b   Jurski, Yan ^a   Sighireanu, Mihaela ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DATA STRUCTURES; INTEGER PROGRAMMING; SEMANTICS;

MULTITHREADED PROGRAMS; PREFIX REWRITING SYSTEMS; RECURSIVE SEQUENTIAL PROGRAMS;

DATA REDUCTION;

EID: 38149077975     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74240-1_1     Document Type: Conference Paper

References (29)

1. Abdulla, P., Nylen, A.: Timed Petri Nets and BQOs. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol. 2075. Springer, Heidelberg (2001)
2. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: Proc. of LICS'96, pp. 313-321 (1996)
3. Abdulla, P.A., Delzanno, G.: On the Coverability Problem for Constrained Multiset Rewriting. In: Proc. of AVIS'06, Satellite workshop of ETAPS'06, Vienna, Austria (2006)
4. Abdulla, P.A., Jonsson, B., Nilsson, M., Saksena, M.: A Survey of Regular Model Checking. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170. Springer, Heidelberg (2004)
5. Abdulla, P.A., Jonsson, B.: Verifying networks of timed processes (extended abstract). In: Steffen, B. (ed.) ETAPS 1998 and TACAS 1998. LNCS, vol. 1384. Springer, Heidelberg (1998)
6. Annichini, A., Asarin, E., Bouajjani, A.: Symbolic techniques for parametric reasoning about counter and clock systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855. Springer, Heidelberg (2000)
7. Arons, T., Pnueli, A., Ruah, S., Xu, J., Zuck, L.D.: Parameterized Verification with Automatically Computed Inductive Assertions. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102. Springer, Heidelberg (2001)
8. Boigelot, B.: Symbolic Methods for Exploring Infinite State Space. PhD thesis, Faculté des Sciences, Université de Liège, vol. 189 (1999)
9. Bojanczyk, M., David, C., Muscholl, A., Schwentick, Th., Segoufin, L.: Two-variable logic on data trees and XML reasoning. In: Proc. of PODS'06. ACM Press, New York (2006)
10. Bojanczyk, M., Muscholl, A., Schwentick, Th., Segoufin, L., David, C.: Two-variable logic on words with data. In: Proc. of LICS'06. IEEE, New York (2006)
11. Bouajjani, A.: Languages, Rewriting systems, and Verification of Infinte-State Systems. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076. Springer, Heidelberg (2001)
12. Bouajjani, A., Bozga, M., Habermehl, P., Iosif, R., Moro, P., Vojnar, T.: Programs with Lists Are Counter Automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144. Springer, Heidelberg (2006)
13. Bouajjani, A., Esparza, J.: Rewriting Models for Boolean Programs. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098. Springer, Heidelberg (2006)
14. Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243. Springer, Heidelberg (1997)
15. Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract Tree Regular Model Checking of Complex Dynamic Data Structures. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol. 4218. Springer, Heidelberg (2006)
16. Bouajjani, A., Jurski, Y., Sighireanu, M.: A generic framework for reasoning about dynamic networks of infinite-state processes. In: TACAS'07. LNCS (2007)
17. Bouajjani, A., Habermehl, P., Mayr, R.: Automatic Verification of Recursive Procedures with one Integer Parameter. Theoretical Computer Science 295 (2003)
18. Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular Model Checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855. Springer, Heidelberg (2000)
19. Bozzano, M., Delzanno, G.: Beyond Parameterized Verification. In: Katoen, J.-P, Stevens, P. (eds.) ETAPS 2002 and TACAS 2002. LNCS, vol. 2280. Springer, Heidelberg (2002)
20. Bradley, A.R., Manna, Z., Sipma, H.B.: What's decidable about arrays? In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855. Springer, Heidelberg (2005)
21. Delzanno, G.: An assertional language for the verification of systems parametric in several dimensions. Electr. Notes Theor. Comput. Sci. 50(4) (2001)
22. Delzanno, G., Raskin, J.-F., Van Begin, L.: Towards the automated verification of multithreaded java programs. In: Katoen, J.-P., Stevens, P. (eds.) ETAPS 2002 and TACAS 2002. LNCS, vol. 2280, pp. 173-187. Springer, Heidelberg (2002)
23. Delzanno, G.: Constraint-based Verification of Parameterized Cache Coherence Protocols. Formal Methods in System Design 23(3) (2003)
24. Demri, S., Lazic, R.: LTL with the freeze quantifier and register automata. In: Proc. of LICS'06. IEEE, New York (2006)
25. Finkel, A., Leroux, J.: How to compose presburger-accelerations: Applications to broadcast protocols. In: Agrawal, M., Seth, A.K. (eds.) FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 2556. Springer, Heidelberg (2002)
26. Finkel, A., Schnoebelen, Ph.: Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1-2), 63-92 (2001)
27. Habermehl, P., Iosif, R., Vojnar, T.: Automata-Based Verification of Programs with Tree Updates. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006 and ETAPS 2006. LNCS, vol. 3920. Springer, Heidelberg (2006)
28. Kesten, Y., Maler, O., Marcus, M., Pnueli, A., Shahar, E.: Symbolic Model Checking with Rich Assertional Languages. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254. Springer, Heidelberg (1997)
29. Wolper, P., Boigelot, B.: Verifying systems with infinite but regular state spaces. In: Vardi, MY. (ed.) CAV 1998. LNCS, vol. 1427. Springer, Heidelberg (1998)