Model checking languages of data words

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

Volumn 7213 LNCS, Issue , 2012, Pages 391-405

  Bollig, Benedikt ^a   Cyriac, Aiswarya ^a   Gastin, Paul ^a   Narayan Kumar, K ^b  

^a CNRS   (France)

^b CHENNAI MATHEMATICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT PROGRAM; DYNAMIC PROCESS; FIRST ORDER LOGIC; INFINITE DOMAINS; MODEL CHECKING PROBLEM; MONADIC SECOND-ORDER LOGIC; SATISFIABILITY; PUSH-DOWN AUTOMATA;

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; COMPUTER CIRCUITS; FORMAL LOGIC; RECONFIGURABLE HARDWARE;

MODEL CHECKING;

EID: 84859143947     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-28729-9_26     Document Type: Conference Paper

References (20)

1. Abdulla, P.A.: Forcing Monotonicity in Parameterized Verification: From Multisets to Words. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorńy, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol. 5901, pp. 1-15. Springer, Heidelberg (2010)
2. Bojańczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. ACM Trans. Comput. Log. 12(4), 27 (2011)
3. Bojańczyk, M., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and applications to XML reasoning. J. ACM 56(3) (2009)
4. Bollig, B.: An automaton Over Data Words that Captures EMSO Logic. In: Katoen, J.-P., König, B. (eds.) CONCUR 2011 - Concurrency Theory. LNCS, vol. 6901, pp. 171-186. Springer, Heidelberg (2011)
5. Bollig, B., Héloüet, L.: Realizability of Dynamic MSC Languages. In: Ablayev, F.M., Mayr, E.W. (eds.) CSR 2010. LNCS, vol. 6072, pp. 48-59. Springer, Heidelberg (2010)
6. Cheng, E.Y.C., Kaminski, M.: Context-free languages over infinite alphabets. Acta Inf. 35(3), 245-267 (1998)
7. Courcelle, B.: Graph rewriting: an algebraic and logic approach. In: Handbook of Theoretical Computer Science, vol. B, pp. 193-242. MIT Press (1990)
8. David, C., Libkin, L., Tan, T.: On the Satisfiability of Two-Variable Logic Over Data Words. In: Fermüller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 248-262. Springer, Heidelberg (2010)
9. Demri, S., Lazić, R.: LTL with the freeze quantifier and register automata. ACM Transactions on Computational Logic 10(3) (2009)
10. Demri, S., Lazić, R., Sangnier, A.: Model Checking Freeze LTL Over One-Counter Automata. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 490-504. Springer, Heidelberg (2008)
11. Demri, S., Sangnier, A.: When Model-Checking Freeze LTL over Counter Machines Becomes Decidable. In: Ong, C.-H.L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 176-190. Springer, Heidelberg (2010)
12. Grumberg, O., Kupferman, O., Sheinvald, S.: Variable Automata over Infinite Alphabets. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 561-572. Springer, Heidelberg (2010)
13. Kaminski, M., Francez, N.: Finite-memory automata. Theoretical Computer Science 134(2), 329-363 (1994)
14. Kaminski, M., Zeitlin, D.: Finite-memory automata with non-deterministic reassignment. Int. J. Found. Comput. Sci. 21(5), 741-760 (2010)
15. La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: LICS 2007, pp. 161-170. IEEE Computer Society Press (2007)
16. La Torre, S., Madhusudan, P., Parlato, G.: Context-Bounded Analysis of Concurrent Queue Systems. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 299-314. Springer, Heidelberg (2008)
17. Leucker, M., Madhusudan, P., Mukhopadhyay, S.: Dynamic Message Sequence Charts. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol. 2556, pp. 253-264. Springer, Heidelberg (2002)
18. Madhusudan, P., Parlato, G.: The tree width of auxiliary storage. In: Ball, T., Sagiv, M. (eds.) POPL 2011, pp. 283-294. ACM (2011)
19. Niewerth, M., Schwentick, T.: Two-variable logic and key constraints on data words. In: Milo, T. (ed.) ICDT 2011, pp. 138-149. ACM (2011)
20. Tzevelekos, N.: Fresh-register automata. In: Ball, T., Sagiv, M. (eds.) POPL 2011, pp. 295-306. ACM (2011)