Sciweavers

632 search results - page 52 / 127
» Proving Invariants of Functional Programs
Sort
View
101
Voted
MPC
1995
Springer
125views Mathematics» more  MPC 1995»
15 years 4 months ago
Synthesizing Proofs from Programs in the Calculus of Inductive Constructions
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
Catherine Parent
98
Voted
STACS
2009
Springer
15 years 7 months ago
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
Kenya Ueno
109
Voted
EUROGP
2009
Springer
132views Optimization» more  EUROGP 2009»
15 years 7 months ago
A Statistical Learning Perspective of Genetic Programming
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
Nur Merve Amil, Nicolas Bredeche, Christian Gagn&e...
ERSHOV
2003
Springer
15 years 5 months ago
On the Possibility of Provably Secure Obfuscating Programs
By obfuscation we mean any efficient semantic-preserving transformation of computer programs aimed at bringing a program into such a form, which impedes the understanding of its al...
Nikolay P. Varnovsky, Vladimir A. Zakharov
JAR
2006
236views more  JAR 2006»
15 years 17 days ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard