1204 search results - page 90 / 241 » Termination of Polynomial Programs |
84
Voted
POPL
2012
ACM
13 years 8 months ago
2012
ACM
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
107
Voted
COMPSAC
2000
IEEE
15 years 5 months ago
2000
IEEE
Genetic programming tackles the issue of how to automatically create a working computer program for a given problem from some initial problem statement. The goal is accomplished i...
190
Voted
POPL
2007
ACM
16 years 1 months ago
2007
ACM
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...
222
click to vote
POPL
2009
ACM
16 years 1 months ago
2009
ACM
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
123
click to vote
TPHOL
2009
IEEE
15 years 7 months ago
2009
IEEE
We present four coinductive operational semantics for the While language accounting for both terminating and non-terminating program runs: big-step and small-step relational semant...