PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Principles of Program Analysis
Principles of Program Analysis
High Performance Compilers for Parallel Computing
High Performance Compilers for Parallel Computing
Program slices: formal, psychological, and practical investigations of an automatic program abstraction method
Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
Formal Verification of Dead Code Elimination in Isabelle/HOL
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A machine-checked model for a Java-like language, virtual machine, and compiler
ACM Transactions on Programming Languages and Systems (TOPLAS)
An operational semantics and type safety prooffor multiple inheritance in C++
Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
Slicing as a program transformation
ACM Transactions on Programming Languages and Systems (TOPLAS)
A new foundation for control dependence and slicing for modern program structures
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special Issue ESOP'05
Slicing for modern program structures: a theory for eliminating irrelevant loops
Information Processing Letters
Precise fixpoint-based analysis of programs with thread-creation and procedures
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Static path conditions for Java
Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security
| Hi-index | 0.00 |
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correctness of slicing, which should ideally be proven independent of concrete programming languages and with the help of well-known verifying techniques such as proof assistants. As a first step in this direction, this contribution presents a framework for dynamic slicing based on control flow and program dependence graphs and machine checked in Isabelle/HOL. Abstracting from concrete syntax we base the framework on a graph representation of the program fulfilling certain structural and well-formedness properties.