4513 search results - page 241 / 903 » Logic programming with satisfiability |
144
click to vote
FORTE
2010
15 years 5 months ago
2010
Abstract. Separation logic is a popular specification language for imperative programs where the heap can only be mentioned through pointsto assertions. However, separation logic&#...
119
click to vote
IUI
1999
ACM
15 years 8 months ago
1999
ACM
Although Programming by Demonstration (PBD) has the potential to improve the productivity of unsophisticated users, previous PBD systems have used brittle, heuristic, domain-speci...
119
click to vote
LOPSTR
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. A formal and effective approach to the extension of the computational behaviour of logic programs is presented. The approach builds upon the following concepts. The exte...
125
click to vote
ICSE
2007
IEEE-ACM
16 years 4 months ago
2007
IEEE-ACM
This paper presents Kato, a tool that implements a novel class of optimizations that are inspired by program slicing for imperative languages but are applicable to analyzable decl...
153
click to vote
BIRTHDAY
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In the implementation of procedures, developers often assume that the input satisfies certain properties; for example, binary search assumes the array to be sorted. Such...