Abstract Execution: Automatically Proving Infinitely Many Programs
Abstract programs contain schematic placeholders representing potentially infinitely many concrete programs. They naturally occur in multiple areas of computer science concerned with correctness: rule-based compilation and optimization, code refactoring and other source-to-source transformations, pr...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
2020
|
| Online Access: | https://tuprints.ulb.tu-darmstadt.de/8540/1/ThesisSteinhoefel.pdf Steinhöfel, Dominic <http://tuprints.ulb.tu-darmstadt.de/view/person/Steinh=F6fel=3ADominic=3A=3A.html> (2020): Abstract Execution: Automatically Proving Infinitely Many Programs.Darmstadt, Technische Universität, DOI: 10.25534/tuprints-00008540 <https://doi.org/10.25534/tuprints-00008540>, [Ph.D. Thesis] |
Internet
https://tuprints.ulb.tu-darmstadt.de/8540/1/ThesisSteinhoefel.pdfSteinhöfel, Dominic <http://tuprints.ulb.tu-darmstadt.de/view/person/Steinh=F6fel=3ADominic=3A=3A.html> (2020): Abstract Execution: Automatically Proving Infinitely Many Programs.Darmstadt, Technische Universität, DOI: 10.25534/tuprints-00008540 <https://doi.org/10.25534/tuprints-00008540>, [Ph.D. Thesis]