Filters








781 Hits in 7.5 sec

Compiling regular patterns

Michael Y. Levin
2003 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming - ICFP '03  
We identify several factors playing a significant role in the quality of the generated code, propose two pattern compilers-one generating backtracking target programs, the other non-backtracking-and sketch  ...  A compiler for such a language must address not only the familiar problems of pattern optimization for ML-style algebraic datatypes and pattern matching, but also some new ones, arising principally from  ...  Washburn, Stephen Tse, Haruo Hosoya, Ralf Hinze, and the ICFP reviewers for reading this paper and suggesting numerous improvements.  ... 
doi:10.1145/944705.944712 dblp:conf/icfp/Levin03 fatcat:f4yopp42ofd4lfbftzr7bgv7wa

Compiling regular patterns

Michael Y. Levin
2003 SIGPLAN notices  
We identify several factors playing a significant role in the quality of the generated code, propose two pattern compilers-one generating backtracking target programs, the other non-backtracking-and sketch  ...  A compiler for such a language must address not only the familiar problems of pattern optimization for ML-style algebraic datatypes and pattern matching, but also some new ones, arising principally from  ...  Washburn, Stephen Tse, Haruo Hosoya, Ralf Hinze, and the ICFP reviewers for reading this paper and suggesting numerous improvements.  ... 
doi:10.1145/944746.944712 fatcat:axiipmbsn5aedefiwxjnaeqxyu

Type-Based Optimization for Regular Patterns [chapter]

Michael Y. Levin, Benjamin C. Pierce
2005 Lecture Notes in Computer Science  
We describe work in progress on a compilation method based on matching automata, a form of tree automata specialized for pattern compilation [9] , in which we use the schema of the value flowing into a  ...  Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML.  ...  The key features of top-down tree automata are that the tag is checked first before the destination states are evaluated on the left and right subtrees of the input value (hence automata are top-down)  ... 
doi:10.1007/11601524_12 fatcat:zb2xa7stgrdifgp55vb6kxpcge

Automata for XML—A survey

Thomas Schwentick
2007 Journal of computer and system sciences (Print)  
Automata play an important role for the theoretical foundations of XML data management, but also in tools for various XML processing tasks.  ...  This survey article aims to give an overview of fundamental properties of the different kinds of automata used in this area and to relate them to the four key aspects of XML processing: schemas, navigation  ...  Acknowledgments The author warmly thanks Joost Engelfriet, Christoph Koch, Sebastian Maneth, Wim Martens, Maarten Marx, Frank Neven, and Volker Weber and two anonymous for very many valuable suggestions  ... 
doi:10.1016/j.jcss.2006.10.003 fatcat:rhcckietinczlgoglqehlg2gza

A term pattern-match compiler inspired by finite automata theory [chapter]

Mikael Pettersson
1992 Lecture Notes in Computer Science  
It also makes checking patterns for exhaustiveness and irredundancy cheap operations.  ...  This algorithm, which was inspired by finite automata theory, addresses these problems and solves them to some extent.  ...  The top-most row has only variable (non-constructor) patllms.  ... 
doi:10.1007/3-540-55984-1_24 fatcat:g3gvtxt6pzeubcefzrpwkfewtm

Parallel search for LTL violations

Michael D. Jones, Jacob Sorber
2003 International Journal on Software Tools for Technology Transfer (STTT)  
A unique advantage of BEE is that it is well-suited for use on clusters of non-dedicated workstations.  ...  Recent advances in parallel model checking for liveness properties achieve significant capacity increases over sequential model checkers.  ...  Fig. 1 . 1 The double depth-first search (DDFS) algorithm for checking the non-emptiness of the language of a Buchi automata. Fig. 2 .Fig. 3 .Fig. 4 . 234 Three algorithms used in BEE.  ... 
doi:10.1007/s10009-003-0115-8 fatcat:7m4htyi4nbbw7ctljrqhtofbvi

Tree Transducers and Formal Methods (Dagstuhl Seminar 13192)

Sebastian Maneth, Helmut Seidl, Marc Herbstritt
2013 Dagstuhl Reports  
Implementability under Resource Restrictions: Which transducer models can be executed by devices with bounded resources, e.g., for processing XML streams?  ...  This seminar was meant to inspire the exchange of theoretical results and practical requirements related to tree transducers.  ...  For instance, ranges of non-linear tree transducers cannot be represented by tree automata.  ... 
doi:10.4230/dagrep.3.5.1 dblp:journals/dagstuhl-reports/ManethS13 fatcat:xxotqpzgnzc3zdlkk4zxsdot5i

Revisiting Underapproximate Reachability for Multipushdown Systems [article]

S. Akshay, Paul Gastin, S Krishna, Sparsa Roychowdhury
2020 arXiv   pre-print
We develop an efficient algorithm for solving the under-approximate reachability problem, which is based on efficient fix-point computations.  ...  To show the versatility of our approach, we then extend our algorithm to the timed setting and provide the first implementation that can handle timed multi-pushdown automata with closed guards.  ...  We would like to thank Gennaro Parlato for the discussions on GetaFix and for providing us benchmarks and anonymous reviewers for more pointers.  ... 
arXiv:2002.05950v2 fatcat:tgrdgpndrvferll4ul7tl2eo64

Constraint Database Solutions to the Genome Map Assembly Problem [chapter]

Viswanathan Ramanathan, Peter Revesz
2004 Lecture Notes in Computer Science  
Hence the first abstraction is much more efficient computationally for very large real genomes.  ...  By extensive computer experiments, we show that in the average case the running time of a constraint automata solution of the big-bag matching abstraction increases linearly, while the running time of  ...  The original automata was described as a non-deterministic automaton, but we give a presentation that is deterministic and uses the concept of "backtracking."  ... 
doi:10.1007/978-3-540-25954-1_6 fatcat:pigrjq2gifb27krygu4flri4bm

Symbolic Tree Transducers [chapter]

Margus Veanes, Nikolaj Bjørner
2012 Lecture Notes in Computer Science  
We examine key closure properties of Symbolic Tree Transducers and we develop a composition algorithm and an equivalence decision procedure for linear single-valued transducers.  ...  We define Symbolic Tree Transducers as a generalization of Regular Transducers as finite state input-output tree automata with logical constraints over a parametric background theory.  ...  However, a generalization to the finite-valued case is not expected to be straightforward, because the corresponding generalization of decidability of equivalence for finite-valued tree transducers [31  ... 
doi:10.1007/978-3-642-29709-0_32 fatcat:yzsxuw5yd5bnbocfqwycsyuewq

Tarjan's Algorithm Makes On-the-Fly LTL Verification More Efficient [chapter]

Jaco Geldenhuys, Antti Valmari
2004 Lecture Notes in Computer Science  
State-of-the-art algorithms for on-the-fly automata-theoretic LTL model checking make use of nested depth-first search to look for accepting cycles in the product of the system and the Büchi automaton.  ...  Here we present a new algorithm based on Tarjan's algorithm for detecting strongly connected components.  ...  Introduction Explicit-state on-the-fly automata-theoretic LTL model checking relies on two algorithms: the first for constructing an automaton that represents the negation of the correctness property,  ... 
doi:10.1007/978-3-540-24730-2_18 fatcat:kijpbg64qjhfjcnjtj35o7btse

Revisiting Underapproximate Reachability for Multipushdown Systems [chapter]

S. Akshay, Paul Gastin, S Krishna, Sparsa Roychowdhury
2020 Lecture Notes in Computer Science  
We develop an efficient algorithm for solving the under-approximate reachability problem, which is based on efficient fix-point computations.  ...  To show the versatility of our approach, we then extend our algorithm to the timed setting and provide the first implementation that can handle timed multipushdown automata with closed guards.  ...  We would like to thank Gennaro Parlato for the discussions on GetaFix and for providing us benchmarks and anonymous reviewers for more pointers.  ... 
doi:10.1007/978-3-030-45190-5_21 fatcat:vxpjfdfbvja3xnd54mkfkcajj4

Taxonomy of XML schema languages using formal language theory

Makoto Murata, Dongwon Lee, Murali Mani, Kohsuke Kawaguchi
2005 ACM Transactions on Internet Technology  
This scenario is appropriate for programming languages and natural languages, where programs and natural language text are strings rather than trees.  ...  trees, we study tree grammars.  ...  Our first algorithm simulates non-deterministic top-down tree automata. It cannot be implemented in the event model but requires the tree model.  ... 
doi:10.1145/1111627.1111631 fatcat:np3lygcjzvdehldu5bultfctlq

ANTLRWorks: an ANTLR grammar development environment

Jean Bovet, Terence Parr
2008 Software, Practice & Experience  
usage and speculative parsing during backtracking.  ...  Still, developing grammars is a non-trivial task.  ...  ACKNOWLEDGEMENTS We would like to thank Bryan Ford, Sylvain Schmitz, and the anonymous reviewers for their detailed reviews and excellent suggestions.  ... 
doi:10.1002/spe.872 fatcat:uxibu66p6vhadoow7git3oy26y

Parallel Model Checking Algorithms for Linear-Time Temporal Logic [chapter]

Jiri Barnat, Vincent Bloemen, Alexandre Duret-Lutz, Alfons Laarman, Laure Petrucci, Jaco van de Pol, Etienne Renault
2018 Handbook of Parallel Constraint Reasoning  
Both approaches are highly non-trivial, since graph (search) algorithms must be redesigned to be fit for parallel computation.  ...  We reiterate the textbook automata-theoretic approach, which reduces the model checking problem to the graph problem of finding cycles.  ...  The LTL model checking algorithm is reduced to emptiness checking of automata, which boils down to detecting accepting cycles.  ... 
doi:10.1007/978-3-319-63516-3_12 fatcat:4st3mofdrzb2linc6mswxhvrfu
« Previous Showing results 1 — 15 out of 781 results