On edge addition rewrite systems and their relevance to program analysis

DOI10.1007/3-540-61228-9_96zbMATH Open1412.68096OpenAlexW2142652792MaRDI QIDQ4645285FDOQ4645285

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

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

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)

Cites Work

• Title not available (Why is that?)
• Properties of data flow frameworks: A unified model
• Precise interprocedural dataflow analysis with applications to constant propagation
• Title not available (Why is that?)

Cited In (1)

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

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)