Abstract interpretation of graphs
From MaRDI portal
Publication:6175105
DOI10.1007/978-3-031-31476-6_4zbMath1529.68201MaRDI QIDQ6175105
Publication date: 17 August 2023
Published in: Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proof versus formalization
- Automatic analysis of pointer aliasing for untyped programs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On the Shortest Route Through a Network
- Calculating Graph Algorithms for Dominance and Shortest Path
- An abstract interpretation-based framework for software watermarking
- On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics
- Systematic design of program transformation frameworks by abstract interpretation
- A Theorem on Boolean Matrices
This page was built for publication: Abstract interpretation of graphs