Canonical graph shapes

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

Volumn 2986, Issue , 2004, Pages 401-415

  Rensink, Arend ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING;

ABSTRACTION MECHANISM; CHARACTERISTIC SHAPES; FINITE ABSTRACTION; FIRST-ORDER GRAPHS; GRAPHICAL REPRESENTATIONS; INTUITIVE MODELING; OBJECT-ORIENTED PROGRAM; POINTER STRUCTURES;

OBJECT ORIENTED PROGRAMMING;

EID: 35048878269     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24725-8_28     Document Type: Article

References (20)

1. F. Baader, ed. The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, 2003.
2. P. Baldan, B. König, and B. König. A logic for analyzing abstractions of graph transformation systems. In R. Cousot, ed., Static Analysis, vol. 2694 of LNCS, pp. 255-272. Springer, 2003.
3. M. Benedikt, T. Reps, and M. Sagiv. A decidable logic for describing linked data structures. In S. D. Swierstra, ed., European Symposium on Programming, vol. 1576 of LNCS, pp. 2-19. Springer, 1999.
4. L. Cardelli, P. Gardner, and G. Ghelli. A spatial logic for querying graphs. In P. Widmayer et al., ed., Automata, Languages and Programming, vol. 2380 of LNCS, pp. 597-610. Springer, 2002.
5. B. Courcelle. Graph rewriting: An algebraic and logic approach. In J. van Leeuwen, ed., Handbook of Theoretical Computer Science, vol. A, pp. 193-239. Elsevier, 1990.
6. D. Distefano, A. Rensink, and J.-P. Katoen. Model checking birth and death. In R. Baeza-Yates, U. Montanari, and N. Santoro, eds., Foundations of Information Technology in the Era of Network and Mobile Computing, vol. 223 of IFIP Conference Proceedings, pp. 435-447. Kluwer Academic Publishers, 2002.
7. D. Distefano, A. Rensink, and J.-P. Katoen. Who is pointing when to whom: On model-checking pointer structures. CTIT Technical Report TR-CTIT-03-12, Department of Computer Science, University of Twente, Sept. 2003.
8. A. P. L. Ferreira and L. Ribeiro. Towards object-oriented graphs and grammars. In U. Nestmann and P. Stevens, eds., Formal Methods for Open Object-Oriented Distributed Systems, vol. 2884 of LNCS, pp. 16-31. Springer, 2003.
9. P. Fradet and D. Le Métayer. Shape types. In Principles of Programming Languages, pp. 27-39. ACM Press, 1997.
10. E. Gradel, P. G. Kolatis, and M. Y. Vardi. On the decision problem for two-variable first-order logic. The Bulletin of Symbolic Logic, 3(l):53-69, Mar. 1997.
11. . 11. E. Grädel, M. Otto, and E. Rosen. Two-variable logic with counting is decidable. In Logic in Computer Science, pp. 306-317. Computer Society Press, 1997.
12. N. Klarlund and M. I. Schwartzbach. Graph types. In Principles of Programming Languages, pp. 196-205. ACM Press, Jan. 1993.
13. M. Mortimer. On languages with two variables. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 21:135-140, 1975.
14. P. O'Hearn, J. Reynolds, and H. Yang. Local reasoning about programs that alter data structures. In L. Fribourg, ed., CSL 2001, vol. 2142 of LNCS, pp. 1-19. Springer, 2001.
15. C. H. Papadimitriou. On the complexity of integer programming. J. ACM, 28(4):765-768, 1981.
16. A. Rensink. A logic of local graph shapes. CTIT Technical Report TR-CTIT-0335, Faculty of Informatics, University of Twente, Aug. 2003.
17. J. Reynolds. Separation logic: A logic for shared mutable data structures. In Logic in Computer Science. Computer Society Press, 2002.
18. M. Sagiv, T. Reps, and R. Wilhelm. Solving shape-analysis problems in languages with destructive updating. ACM Trans. Prog. Lang. Syst., 20(1):1-50, Jan. 1998.
19. D. Scott. A decision method for validity of sentences in two variables. J. Symb. Log., 27:477, 1962.
20. H. Yang and P. O'Hearn. A semantic basis for local reasoning. In M. Nielsen and U. Engberg, eds., Foundations of Software Science and Computation Structures, vol. 2303 of LNCS, pp. 402-416. Springer, 2002.