91 search results - page 11 / 19 » Inductive Beluga: Programming Proofs |
EUROGP
2001
Springer
15 years 4 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
212
click to vote
POPL
2008
ACM
16 years 9 days ago
2008
ACM
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
112
click to vote
PPDP
2007
Springer
15 years 6 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
JAR
2008
14 years 12 months ago
2008
This article describes the formal verification of a compilation algorithm that transforms parallel moves (parallel assignments between variables) into a semanticallyequivalent sequ...
112
click to vote
PLPV
2009
ACM
15 years 9 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...