Caterpillars: a context specification technique

Brüggemann-Klein, Anne; Wood, Derick

doi:10.1162/109966200750410613

Cited by 35 publications

(21 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Quite recently they came into fashion again as a model for translation of XML specifications [43,65,47,37,57,10].…”

Section: Single Head On Treesmentioning

confidence: 99%

“…For tree-walking automata however, the situation was unclear for a long time. They accept regular tree languages only [36,23], but it was conjectured in [18] (and later in [21,19,10]) that tree-walking automata cannot accept all regular tree languages 6 . This was first proved for 'one-visit' automata (for the deterministic case in [6,50], and for the nondeterministic case in [48]).…”

Section: Single Head On Treesmentioning

confidence: 99%

See 1 more Smart Citation

Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure

Engelfriet¹,

Hoogeboom²

2007

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. String languages recognizable in (deterministic) log-space are characterized either by two-way (deterministic) multi-head automata, or following Immerman, by firstorder logic with (deterministic) transitive closure. Here we elaborate this result, and match the number of heads to the arity of the transitive closure. More precisely, first-order logic with k-ary deterministic transitive closure has the same power as deterministic automata walking on their input with k heads, additionally using a finite set of nested pebbles. This result is valid for strings, ordered trees, and in general for families of graphs having a fixed automaton that can be used to traverse the nodes of each of the graphs in the family. Other examples of such families are grids, toruses, and rectangular mazes. For nondeterministic automata, the logic is restricted to positive occurrences of transitive closure.The special case of k = 1 for trees, shows that single-head deterministic tree-walking automata with nested pebbles are characterized by first-order logic with unary deterministic transitive closure. This refines our earlier result that placed these automata between first-order and monadic second-order logic on trees.

show abstract

“…Quite recently they came into fashion again as a model for translation of XML specifications [43,65,47,37,57,10].…”

Section: Single Head On Treesmentioning

confidence: 99%

Section: Single Head On Treesmentioning

confidence: 99%

Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure

Engelfriet¹,

Hoogeboom²

2007

Logical Methods in Computer Science

View full text Add to dashboard Cite

show abstract

“…Hence, from a scientific viewpoint, we believe it makes sense to study the broader class of possibly non-deterministic but simple and practical regular expressions. Another consequence of our results, independent of the one-unambiguous issue, is that optimization problems for navigational queries as expressed by caterpillar expressions [5], X CPath reg and X reg [16], or regular path queries [6] quickly turn intractable. Due to space limitations many proofs are omitted.…”

Section: Introductionmentioning

confidence: 87%

Complexity of Decision Problems for Simple Regular Expressions

Martens

Neven

Schwentick

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the concatenation of factors where each factor is a disjunction of strings possibly extended with ' * ' or '?'. We obtain lower and upper bounds for various fragments of simple regular expressions. Although we show that inclusion and intersection are already intractable for very weak expressions, we also identify some tractable cases. For equivalence, we only prove an initial tractability result leaving the complexity of more general cases open. The main motivation for this research comes from database theory, or more specifically XML and semi-structured data. We namely show that all lower and upper bounds for inclusion and equivalence, carry over to the corresponding decision problems for extended context-free grammars and single-type tree grammars, which are abstractions of DTDs and XML Schemas, respectively. For intersection, we show that the complexity only carries over for DTDs.

show abstract

“…The tree-automata (TA) based intermediate language used internally in BcMacro is based on a behavior model that combines features of both tree-walking automata * 6 used for the implementation of XPath [2], and the marking tree automaton, used for implementation of XML patterns [17].…”

Section: Ta-based Intermediate Languagementioning

confidence: 99%

Design and Implementation of a Java Bytecode Manipulation Library for Clojure

Umatani

Ugawa

Yasugi

2015

Journal of Information Processing

View full text Add to dashboard Cite

Abstract:Recently, the Java Virtual Machine (JVM) has become widely used as a common execution platform for various applications. There is often the need to manipulate bytecodes at class-load time, particularly in application domains that demand dynamic modification of program behaviors. Whereas several bytecode manipulation tools for Java exist for implementing such behaviors, JVM is also the platform for various modern programming languages, and there is no need to write bytecode manipulation programs exclusively in Java. In this paper, we propose a novel bytecode manipulation library for Clojure, a Lisp dialect running on JVM. Our library is as expressive and flexible as ASM, the de facto standard bytecode manipulation tool in Java, while enabling more concise representation of typical manipulation cases. Our library works at class-load time as a series of rewrites of (parts of) the tree representing the target class file, basically in a similar way to Lisp's macro system. However, our library differs from Lisp's macro system in the following significant respects. First, instead of matching a single name against the first item of the target form (tree), our library matches a tree pattern against the target tree itself during macro expansion so that users can define rewriting rules for raw class files that cannot contain any special tags (names) for pattern matching. Furthermore, along with matching tree patterns, our library can extract any information from the static context easily and thus allows users to avoid cumbersome manual management of such information.

show abstract

Caterpillars: a context specification technique

Cited by 35 publications

References 9 publications

Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure

Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure

Complexity of Decision Problems for Simple Regular Expressions

Design and Implementation of a Java Bytecode Manipulation Library for Clojure

Contact Info

Product

Resources

About