Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
333,274
Graph-Transformation Verification using Monadic Second-Order Logic
"... The paper presents a new approach to solving the problem of verification of graph transformation, by proposing a new static verification algorithm for the Core UnCAL, the query algebra for graph-structured databases proposed by Bunemann et al. Given a graph transformation annotated with schema infor ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
information, our algorithm statically verifies that any graph satisfying the input schema is converted by the transformation to a graph satisfying the output schema. We tackle the problem by first reformulating the semantics of UnCAL using monadic second-order logic (MSO). The logic-based foundation allows
The monadic second-order logic of graphs I. Recognizable sets of Finite Graphs
- Information and Computation
, 1990
"... The notion of a recognizable sef offinite graphs is introduced. Every set of finite graphs, that is definable in monadic second-order logic is recognizable, but not vice versa. The monadic second-order theory of a context-free set of graphs is decidable. 0 19W Academic Press. Inc. This paper begins ..."
Abstract
-
Cited by 293 (17 self)
- Add to MetaCart
an investigation of the monadic second-order logic of graphs and of sets of graphs, using techniques from universal algebra, and the theory of formal languages. (By a graph, we mean a finite directed hyperedge-labelled hypergraph, equipped with a sequence of distinguished vertices.) A survey of this research can
Graph-Query Verification using Monadic Second-Order Logic
"... Abstract. This paper presents a static verification algorithm for a core subset of UnCAL, the query algebra for graph-structured databases proposed by Bunemann et al. Given a query and input/output schemas, our algorithm statically verifies that any graph satisfying the input schema is converted by ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
by the query to a graph satisfying the output schema. The basic idea is to reformulate the semantics of UnCAL using monadic second-order logic (MSO). The logic-based foundation allows to express the schema satisfaction of transformations as the validity of MSO formulas over graph structures. Furthermore
Hardware Verification using Monadic Second-Order Logic
- IN COMPUTER AIDED VERIFICATION : 7TH INTERNATIONAL CONFERENCE, CAV '95, LNCS 939
, 1995
"... We show how the second-order monadic theory of strings can be used to specify hardware components and their behavior. This logic admits a decision procedure and counter-model generator based on canonical automata for formulas. We have used a system implementing these concepts to verify, or find e ..."
Abstract
-
Cited by 25 (10 self)
- Add to MetaCart
We show how the second-order monadic theory of strings can be used to specify hardware components and their behavior. This logic admits a decision procedure and counter-model generator based on canonical automata for formulas. We have used a system implementing these concepts to verify, or find
Automata for the verification of monadic second-order graph properties
- JOURNAL OF APPLIED LOGIC
, 2012
"... ..."
Circle graphs and Monadic Second-order logic
, 2005
"... A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique representation as a set of intersecting chords, and we prove that this representation can be defined by monadic second-order ..."
Abstract
-
Cited by 10 (4 self)
- Add to MetaCart
formulas. By using the (canonical) split decomposition of a circle graph, one can define in monadic second-order logic all its chord representations formalized as words with two occurrences of each letter. This construction uses the general result that the split decomposition of a graph can be constructed
The Expression Of Graph Properties And Graph Transformations In Monadic Second-Order Logic
, 1997
"... By considering graphs as logical structures, one... ..."
Abstract
-
Cited by 160 (40 self)
- Add to MetaCart
By considering graphs as logical structures, one...
Monadic Second-order Logic for Parameterized Verification
- Basic Research in Computer Science
, 1994
"... Much work in automatic verification considers families of similar finite-state systems. But an often overlooked property is that sometimes a single finite-state system can be used to describe a parameterized, infinite family of systems. Thus verification of unbounded state spaces can take place ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Much work in automatic verification considers families of similar finite-state systems. But an often overlooked property is that sometimes a single finite-state system can be used to describe a parameterized, infinite family of systems. Thus verification of unbounded state spaces can take place
Automatic Verification of Pointer Programs using Monadic Second-Order Logic
- In Proc. ACM PLDI, Las Vegas, NV
, 1997
"... We present a technique for automatic verification of pointer programs based on a decision procedure for the monadic second-order logic on finite strings. We are concerned with a while-fragment of Pascal, which includes recursively-defined pointer structures but excludes pointer arithmetic. We define ..."
Abstract
-
Cited by 63 (8 self)
- Add to MetaCart
We present a technique for automatic verification of pointer programs based on a decision procedure for the monadic second-order logic on finite strings. We are concerned with a while-fragment of Pascal, which includes recursively-defined pointer structures but excludes pointer arithmetic. We
Results 1 - 10
of
333,274
