On edge addition rewrite systems and their relevance to program analysis

DOI10.1007/3-540-61228-9_96MaRDI QIDQ4645285zbMATH OpenOpenAlexFDO

Authors Uwe Aßmann

Publication date 10 January 2019

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61228-9_96

zbMATH Keywords

index theoremindex structuresource nodebasic blockdirect derivation

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)

Recommendations

• Publication:4940927
• Publication:4890715
• Efficient graph rewriting and its implementation
• Rewriting Approximations for Fast Prototyping of Static Analyzers
• A kernel language for programmed rewriting of (hyper)graphs

Cites work

• scientific article; zbMATH DE number 3548465 (Why is no real title available?)
• scientific article; zbMATH DE number 3592938 (Why is no real title available?)
• Precise interprocedural dataflow analysis with applications to constant propagation
• Properties of data flow frameworks: A unified model

Cited in

(1)

• Interconvertibility of a class of set constraints and context-free-language reachability

Describes a project that uses

Uses Software

• Datalog

This page was built for publication: On edge addition rewrite systems and their relevance to program analysis

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