Towards an Efficient Implementation of Tree Automata Completion
From MaRDI portal
Publication:5505416
DOI10.1007/978-3-540-79980-1_6zbMath1170.68425OpenAlexW1796765441MaRDI QIDQ5505416
Pierre-Etienne Moreau, Thomas Genet, Emilie Balland, Yohan Boichut
Publication date: 27 January 2009
Published in: Algebraic Methodology and Software Technology (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00304010/file/finalversion.pdf
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Equational approximations for tree automata completion, TAGED Approximations for Temporal Properties Model-Checking, How to Tackle Integer Weighted Automata Positivity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reachability analysis over term rewriting systems
- Handling Algebraic Properties in Automatic Analysis of Security Protocols
- Automated Reasoning
- Computer Aided Verification
- Rewriting Approximations for Fast Prototyping of Static Analyzers
- Rewriting Techniques and Applications