Abstraction of Graph Transformation Systems by Temporal Logic and Its Verification

Authors:
Mitsuharu Yamamoto;Yoshinori Tanabe;Koichi Takahashi;Masami Hagiya
Affiliations:
Faculty of Science, Chiba University,;Research Center for Verification and Semantics, National Institute of Advanced Industrial Science and Technology (AIST), and Graduate School of Information Science and Technology, University of To ...;Research Center for Verification and Semantics, National Institute of Advanced Industrial Science and Technology (AIST),;Graduate School of Information Science and Technology, University of Tokyo, and NTT Communication Science Laboratories,
Venue:
Verified Software: Theories, Tools, Experiments
Year:
2005

Citing 17
Cited 1

Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
A theory of timed automata

Theoretical Computer Science
Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
Time-based expressivity of timed Petri nets for system specification

Theoretical Computer Science
Modal logic

Modal logic
Parametric shape analysis via 3-valued logic

ACM Transactions on Programming Languages and Systems (TOPLAS)
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Reasoning about The Past with Two-Way Automata

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Formalization of Planar Graphs

Proceedings of the 8th International Workshop on Higher Order Logic Theorem Proving and Its Applications
Formalization of Graph Search Algorithms and Its Applications

Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Shape Analysis through Predicate Abstraction and Model Checking

VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Decidability of Safety Properties of Timed Multiset Rewriting

FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
The Hybrid µ-Calculus

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Automata logics, and infinite games: a guide to current research

Automata logics, and infinite games: a guide to current research
Finite differencing of logical formulas for static analysis

ESOP'03 Proceedings of the 12th European conference on Programming
A decision procedure for the alternation-free two-way modal µ-calculus

TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods

Abstraction and training of stochastic graph transformation systems

FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering

Quantified Score

Hi-index	0.00

Visualization

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.