Rewriting Approximations for Fast Prototyping of Static Analyzers

DOI10.1007/978-3-540-73449-9_6MaRDI QIDQ5432332zbMATH OpenOpenAlexFDO

Authors

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

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Recommendations

• On the complexity analysis of static analyses
• Improving the static analysis of embedded languages via partial evaluation
• Incorporating static analysis in a combinator-based compiler
• Static analysis by abstract interpretation: a mathematical programming approach
• scientific article; zbMATH DE number 1341616

Cited in

(16)

• Incorporating static analysis in a combinator-based compiler
• scientific article; zbMATH DE number 1617328 (Why is no real title available?)
• Sawja: static analysis workshop for Java
• The emptiness problem for tree automata with at least one global disequality constraint is NP-hard
• TAGED Approximations for Temporal Properties Model-Checking
• How to Tackle Integer Weighted Automata Positivity
• On edge addition rewrite systems and their relevance to program analysis
• Symbol different term rewrite systems
• Small Formulas for Large Programs: On-Line Constraint Simplification in Scalable Static Analysis
• Handling left-quadratic rules when completing tree automata
• Completeness of tree automata completion
• Towards an Efficient Implementation of Tree Automata Completion
• Ground approximations of term rewriting systems
• Termination criteria for tree automata completion
• A theoretical limit for safety verification techniques with regular fix-point computations
• Equational approximations for tree automata completion

Describes a project that uses

Uses Software

• JavaFAN
• Timbuk

This page was built for publication: Rewriting Approximations for Fast Prototyping of Static Analyzers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5432332)