Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Topics in online partial evaluation
Topics in online partial evaluation
An axiomatic basis for computer programming
Communications of the ACM
Dynamic Logic
The verifying compiler: A grand challenge for computing research
Journal of the ACM (JACM)
Automatic program specialization for Java
ACM Transactions on Programming Languages and Systems (TOPLAS)
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
A program verifier
Compiler verification: a bibliography
ACM SIGSOFT Software Engineering Notes
Verification of object-oriented software: The KeY approach
Verification of object-oriented software: The KeY approach
Interleaving symbolic execution and partial evaluation
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
TVOC: a translation validator for optimizing compilers
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Variability modelling in the ABS language
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
PE-KeY: a partial evaluator for java programs
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Hi-index | 0.00 |
Partial evaluation is a program specialization technique that allows to optimize a program for which partial input is known. We propose a new approach to generate specialized programs for a Java-like language via the software verification tool KeY. This is achieved by symbolically executing source programs interleaved with calls to a simple partial evaluator. In a second phase the specialized programs are synthesized from the symbolic execution tree. The correctness of this approach is guaranteed by a bisimulation relation on the source and specialized programs.