Rewriting Approximations for Fast Prototyping of Static Analyzers
From MaRDI portal
Publication:5432332
DOI10.1007/978-3-540-73449-9_6zbMath1203.68068OpenAlexW1532452539MaRDI QIDQ5432332
No author found.
Publication date: 2 January 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73449-9_6
Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (10)
The emptiness problem for tree automata with at least one global disequality constraint is NP-hard ⋮ Unnamed Item ⋮ Symbol different term rewrite systems ⋮ A theoretical limit for safety verification techniques with regular fix-point computations ⋮ Equational approximations for tree automata completion ⋮ Termination criteria for tree automata completion ⋮ TAGED Approximations for Temporal Properties Model-Checking ⋮ Handling Left-Quadratic Rules When Completing Tree Automata ⋮ How to Tackle Integer Weighted Automata Positivity ⋮ Towards an Efficient Implementation of Tree Automata Completion
Uses Software
This page was built for publication: Rewriting Approximations for Fast Prototyping of Static Analyzers
