Abstract
Abstract model checking has been studied as a promising technique for applying various model checking methods to infinite state systems. Graph transformation systems [11], which can model many distributed and concurrent algorithms, are examples of such infinite systems.
We have been studying abstraction of several kinds of link structures, which are instances of graph transformation systems. First, we introduced abstraction of heap structures using regular expressions mainly for verifying concurrent garbage collection algorithms [14,15]. In this setting, each cell has a color and a link to another cell. Since cells can be allocated dynamically during execution, it is impossible to enumerate all the execution states of the heap. Thus we need to use abstraction for applying finite verification methods.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Alur, R., Dill, D.L.: A Theory of Timed Automata. Theoretical Computer Science 126, 183–236 (1994)
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)
Bryant, R.E.: Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams. ACM Computing Surveys 24(3), 293–318 (1992)
Cerone, A., Maggiolo-Schettini, A.: Time-Based Expressivity of Time Petri Nets for System Specification. Theoretical Computer Science 216, 1–53 (1999)
Dams, D., Namjoshi, K.S.: Shape analysis through predicate abstraction and model checking. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds.) VMCAI 2003. LNCS, vol. 2575, pp. 310–323. Springer, Heidelberg (2002)
Emerson, E.A.: Temporal and Modal Logic. In: Handbook of Theoretical Computer Science. Formal Models and Semantics, vol. B, pp. 995–1072. Elsevier, Amsterdam (1990)
Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)
Hagiya, M., Takahashi, K., Yamamoto, M., Sato, T.: Analysis of Synchronous and Asynchronous Cellular Automata using Abstraction by Temporal Logic. In: Kameyama, Y., Stuckey, P.J. (eds.) FLOPS 2004. LNCS, vol. 2998, pp. 7–21. Springer, Heidelberg (2004)
Reps, T., Sagiv, M., Loginov, A.: Finite Differencing of Logical Formulas for Static Analysis. In: European Symposium on Programming, pp. 380–398 (2003)
Reynolds, J.C.: Separation Logic: A Logic for Shared Mutable Data Structures. In: Proceedings of the Seventeenth Annual IEEE Symposium on Logic in Computer Science, pp. 55–74 (2002)
Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol. 1. World Scientific, Singapore (1997)
Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems 24(3), 217–298 (2002)
Sattler, U., Vardi, M.Y.: The Hybrid μ-Calculus. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 76–91. Springer, Heidelberg (2001)
Takahashi, K., Hagiya, M.: Abstraction of Link Structures by Regular Expressions and Abstract Model Checking of Concurrent Garbage Collection. In: First Asian Workshop on Programming Languages and Systems, pp. 1–8 (2000)
Takahashi, K., Hagiya, M.: Formal Proof of Abstract Model Checking of Concurrent Garbage Collection. In: Workshop on Thirty Five years of Automath, Informal Proceedings, Heriot-Watt University, Edinburgh, April, 2002, pp. 115–126 (2002)
Takahashi, K., Hagiya, M.: Abstraction of Graph Transformation using Temporal Formulas. In: Supplemental Volume of the 2003 International Conference on Dependable Systems and Networks (DSN-2003), pp. W-65 – W-66 (2003)
Tanabe, Y., Takahashi, K., Yamamoto, M., Sato, T., Hagiya, M.: An Implementation of a Decision Procedure for Satisfiability of Two-Way CTL Formulas Using BDD (in Japanese). Computer Software, Japan Society for Software Science and Technology 22(3), 154–166 (2005)
Tanabe, Y., Takai, T., Sekizawa, T., Takahashi, K.: Preconditions of Properties Described in CTL for Statements Manipulating Pointers. In: Supplemental Volume of the 2005 International Conference on Dependable Systems and Networks, June 28 – July 1, 2005, pp. 228–234 (2005)
Tanabe, Y., Takahashi, K., Yamamoto, M., Tozawa, A., Hagiya, M.: A Decision Procedure for the Alternation-Free Two-Way Modal μ-Calculus. In: Beckert, B. (ed.) TABLEAUX 2005. LNCS (LNAI), vol. 3702, pp. 277–291. Springer, Heidelberg (2005)
Vardi, M.Y.: Reasoning about the Past with Two-Way Automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 628–641. Springer, Heidelberg (1998)
Yamamoto, M., Nishizaki, S., Hagiya, M., Toda, Y.: Formalization of Planar Graphs. In: Schubert, E.T., Alves-Foss, J., Windley, P. (eds.) HUG 1995. LNCS, vol. 971, pp. 369–384. Springer, Heidelberg (1995)
Yamamoto, M., Takahashi, K., Hagiya, M., Nishizaki, S., Tamai, T.: Formalization of Graph Search Algorithms and Its Applications. In: Grundy, J., Newey, M. (eds.) TPHOLs 1998. LNCS, vol. 1479, pp. 479–496. Springer, Heidelberg (1998)
Yamamoto, M., Cottin, J.-M., Hagiya, M.: Decidability of Safety Properties of Timed Multiset Rewriting. In: Damm, W., Olderog, E.-R. (eds.) FTRTFT 2002. LNCS, vol. 2469, pp. 165–183. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Yamamoto, M., Tanabe, Y., Takahashi, K., Hagiya, M. (2008). Abstraction of Graph Transformation Systems by Temporal Logic and Its Verification. In: Meyer, B., Woodcock, J. (eds) Verified Software: Theories, Tools, Experiments. VSTTE 2005. Lecture Notes in Computer Science, vol 4171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69149-5_57
Download citation
DOI: https://doi.org/10.1007/978-3-540-69149-5_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69147-1
Online ISBN: 978-3-540-69149-5
eBook Packages: Computer ScienceComputer Science (R0)