Filters








3,485 Hits in 4.7 sec

Formal Verification of Graph Grammars using Mathematical Induction

Simone André da Costa, Leila Ribeiro
2009 Electronical Notes in Theoretical Computer Science  
Graph grammars are a formal language suitable for the specification of reactive systems [11, 18] .  ...  Graph grammars are a formal description technique suitable for the specification of distributed and reactive systems. Model-checking of graph grammars is currently supported by various approaches.  ...  grammar applicable to a reachable graph g (i.e., for ap(αi, m) g), considering that the property is valid for g.  ... 
doi:10.1016/j.entcs.2009.05.044 fatcat:4un7eoelmreahkp7bgngjul7mm

Using Graph Transformation for Practical Model-Driven Software Engineering [chapter]

Lars Grunske, Leif Geiger, Albert Zündorf, Niels Van Eetvelde, Pieter Van Gorp, Dániel Varró
2005 Model-Driven Software Development  
Several formalisms are currently proposed for the specification of these model transformations. A suitable formalism is based on graph transformation systems and graph transformation rules.  ...  Model transformations are one of the core technologies needed to apply OMG's model driven engineering concept for the construction of real world systems.  ...  The required reachability property stating that each state of the statechart should be reachable can be expressed by the graph pattern of Figure 11 .  ... 
doi:10.1007/3-540-28554-7_5 fatcat:t4sc2cmeargp5dtogdjtvqbmuy

Modelling Dynamic Software Architectures using Typed Graph Grammars

Roberto Bruni, Antonio Bucchiarone, Stefania Gnesi, Hernán Melgratti
2008 Electronical Notes in Theoretical Computer Science  
As a result we explain different styles of architectural dynamisms in term of graph grammars and get some better insights on the kinds of formal properties that can be naturally associated to such different  ...  specification styles.  ...  Next work will approach the problem of verifying such properties over graph grammar specifications.  ... 
doi:10.1016/j.entcs.2008.04.073 fatcat:rxke4vmarzdajaqv5jekpmzvsu

Finitely Representing Infinite Reachability Graphs of CFSMs with Graph Grammars [chapter]

Y. -M. Quemener, T. Jéron
1996 IFIP Advances in Information and Communication Technology  
We propose here an algorithm enabling to represent, in a finite way, some infinite reachability graphs of communicating finite-state machines, by using a graph grammar.  ...  We deduce a method for detecting patterns that compose the infinite reachability graph on study.  ...  Infinite Reachability Graphs 365 have decidable properties.  ... 
doi:10.1007/978-0-387-35079-0_23 fatcat:v3emlmkpobfqrdz754lce47vnu

Verification of graph grammars using a logical approach

Simone André da Costa, Leila Ribeiro
2012 Science of Computer Programming  
Graph grammars may be used as specification technique for different kinds of systems, specially in situations in which states are complex structures that can be adequately modeled as graphs (possibly with  ...  Other approaches propose over-and/or under-approximations of the state space, but in this case it is not possible to check arbitrary properties.  ...  grammar applicable to a reachable graph G (i.e., for ap(αi, m) G), considering that the property is valid for G.  ... 
doi:10.1016/j.scico.2010.02.006 fatcat:fgtfde4jsjdqjmkxvzrcrckchq

Distributed Processing of Generalized Graph-Pattern Queries in SPARQL 1.1 [article]

Sairam Gurajada, Martin Theobald
2016 arXiv   pre-print
Specifically, the class of queries we consider consists of sets of SPARQL triple patterns with labeled property paths.  ...  Unlike most prior works in this field, we specifically aim at the unified optimization and distributed processing of queries consisting of both relational joins and graph-reachability predicates.  ...  For this, we collect various statistics over the RDF data for both the basic triple patterns and triple patterns with property paths. Statistics for Triple Patterns.  ... 
arXiv:1609.05293v2 fatcat:d5dvgojzfzajro3knlrt4pcnti

Embedded and Real-time Systems [chapter]

Edward L. Lamie
2009 Real-Time Embedded Multithreading Using ThreadX  
Verification models and techniques applied to testing and control of reactive systems RESEARCH CENTER Rennes -Bretagne-Atlantique THEME Embedded and Real Time Systems Project-Team VERTECS  ...  Deterministic graph grammars enable us to focus on structural properties of systems.  ...  For graphs with finite degree, these grammars characterise transition graphs of pushdown automata (the correspondence between graphs generated by grammars and transition graphs of pushdown automata is  ... 
doi:10.1016/b978-1-85617-601-9.00001-2 fatcat:oo46lkp3gnbhbjc463pu7fs2hi

Embedded and Real-time Systems [chapter]

Edward L. Lamie
2009 Real-Time Embedded Multithreading Using ThreadX and MIPS  
Verification models and techniques applied to testing and control of reactive systems RESEARCH CENTER Rennes -Bretagne-Atlantique THEME Embedded and Real Time Systems Project-Team VERTECS  ...  Deterministic graph grammars enable us to focus on structural properties of systems.  ...  For graphs with finite degree, these grammars characterise transition graphs of pushdown automata (the correspondence between graphs generated by grammars and transition graphs of pushdown automata is  ... 
doi:10.1016/b978-1-85617-631-6.00001-9 fatcat:sq7s43icwvgk7lro4lpmj46g4a

Towards a Rule-Level Verification Framework for Property-Preserving Graph Transformations

Hanh Nhi Tran, Christian Percebois
2012 2012 IEEE Fifth International Conference on Software Testing, Verification and Validation  
Our approach uses a relational representation for graph grammar and a logical representation for graph properties with first-order logic formulas.  ...  The presented work consists in identifying the general conditions for a graph grammar to preserve graph properties, in particular structural properties.  ...  In this approach, applying the transduction over a source graph grammar gives another graph grammar similar to the one obtained when applying a rule to the initial state of the source grammar.  ... 
doi:10.1109/icst.2012.200 dblp:conf/icst/TranP12 fatcat:m4okfc5qb5hr5ei2aext3gdpla

Decidability and Tractability of Problems in Object-Based Graph Grammars [chapter]

Aline Brum Loreto, Leila Ribeiro, Laira Vieira Toscani
2002 Foundations of Information Technology in the Era of Network and Mobile Computing  
In this paper we analyze the problem of verifying if a message can be delivered. We model object-based systems as a graph grammars, and analyze this property as a graph grammar property.  ...  With suitable restrictions on the kind of graph grammar rules that are used, decidability can also be proven.  ...  This property in Context Free Grammar (CFG) corresponds to find out if a non-terminal is reachable.  ... 
doi:10.1007/978-0-387-35608-2_33 dblp:conf/ifipTCS/LoretoRT02 fatcat:7zax3nvw5ndbljrgvxralrlvqm

Rewriting Logic Semantics and Verification of Model Transformations [chapter]

Artur Boronat, Reiko Heckel, José Meseguer
2009 Lecture Notes in Computer Science  
, which can then be used for defining the semantics of modelbased domain-specific languages.  ...  Specifically, we formalize model transformations as theories in rewriting logic, so that Maude's reachability analysis and model checking features can be used for verifying them.  ...  We cordially thank Francisco Durán for his kind help with the CRC and MTT Maude tools. We also thank the anonymous reviewers for their helpful comments and suggestions.  ... 
doi:10.1007/978-3-642-00593-0_2 fatcat:6i4gmdhqwrbqxn7c26zqq26sa4

Optimal code generation for expression trees: an application BURS theory

E. Pelegrí-Llopart, S. L. Graham
1988 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '88  
A Rewrite System is a collection of rewrite rules of the form a-p where a and 0 are tree patterns.  ...  This paper introduces a class of rewrite systems called Bottom-Up Rewrite Systems (BURS), and a tabledriven algorithm to solve REACHABILITY for members of the class.  ...  David Chase helped us by providing his bottom-up pattern matcher. We gratefully acknowledge the members of our research group for useful conversations and constructive feedback. Bibliography  ... 
doi:10.1145/73560.73586 dblp:conf/popl/Pelegri-LlopartG88 fatcat:4ozjsc27ebbvfiuqfeuz732idm

Optimal code generation for expression trees

A. V. Aho, S. C. Johnson
1975 Proceedings of seventh annual ACM symposium on Theory of computing - STOC '75  
A Rewrite System is a collection of rewrite rules of the form a-p where a and 0 are tree patterns.  ...  This paper introduces a class of rewrite systems called Bottom-Up Rewrite Systems (BURS), and a tabledriven algorithm to solve REACHABILITY for members of the class.  ...  David Chase helped us by providing his bottom-up pattern matcher. We gratefully acknowledge the members of our research group for useful conversations and constructive feedback. Bibliography  ... 
doi:10.1145/800116.803770 dblp:conf/stoc/AhoJ75 fatcat:j2pjgaelnfgpvdyqdkvyl7pn5a

Stochastic Object-Based Graph Grammars

Odorico M. Mendizabal, Fernando L. Dotti, Leila Ribeiro
2007 Electronical Notes in Theoretical Computer Science  
Object-Based Graph Grammar (OBGG) is a formal visual language suited to the specification of asynchronous distributed systems based on message passing.  ...  SAN is a Markov Chain equivalent formalism having as advantage its modularity in terms of representation and a compact mathematical solution, allowing the analysis of models with larger state space.  ...  Object Based Graph Grammars (OBGG) [5] is a graphical formal specification language suitable for the specification of asynchronous distributed systems.  ... 
doi:10.1016/j.entcs.2007.03.020 fatcat:ekx3rgx6ojci7fqsjpl2twvaty

Diagnosing memory leaks using graph mining on heap dumps

Evan K. Maxwell, Godmar Back, Naren Ramakrishnan
2010 Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '10  
We demonstrate several synthetic as well as real-world examples of heap dumps for which our approach provides more insight into the problem than state-of-the-art tools such as Eclipse's MAT.  ...  Although heap dumps are commonly analyzed in existing heap profiling tools, our work is the first to apply a graph grammar mining solution to this problem.  ...  Also, we would like to thank Jongsoo Park, the developer of the dominator tree algorithm used in the Boost C++ libraries, for his ready responses to our questions and comments.  ... 
doi:10.1145/1835804.1835822 dblp:conf/kdd/MaxwellBR10 fatcat:5xyuswn24fc4fneewxu3kd77ha
« Previous Showing results 1 — 15 out of 3,485 results