Sciweavers

1288 search results - page 124 / 258
» Visual Generalization in Programming by Example
Sort
View
POPL
2006
ACM
16 years 3 months ago
Verifying properties of well-founded linked lists
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
Shuvendu K. Lahiri, Shaz Qadeer
POPL
2011
ACM
14 years 5 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
IJCAI
1989
15 years 4 months ago
Constrained Heuristic Search
Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has...
Mark S. Fox, Norman M. Sadeh, Can A. Baykan
ECOOP
2009
Springer
16 years 3 months ago
Stepping Stones over the Refactoring Rubicon
Refactoring tools allow the programmer to pretend they are working with a richer language where the behaviour of a program is automatically preserved during restructuring. In this ...
Mathieu Verbaere, Max Schäfer, Oege de Moor, ...
ICFP
2002
ACM
16 years 2 months ago
An expressive, scalable type theory for certified code
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...
Karl Crary, Joseph Vanderwaart