Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL
From MaRDI portal
Publication:3543667
DOI10.1007/978-3-540-71067-7_24zbMath1165.68477MaRDI QIDQ3543667
Andreas Lochbihler, Daniel Wasserrab
Publication date: 4 December 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://publikationen.bibliothek.kit.edu/1000008488/706398
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Slicing for modern program structures: a theory for eliminating irrelevant loops
- Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures
- Dynamic slicing: a generic analysis based on a natural semantics format
- Formal certification of a compiler back-end or
- Types for Proofs and Programs