4513 search results - page 613 / 903 » Logic programming with satisfiability |
129
click to vote
ESOP
2012
Springer
13 years 12 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
145
click to vote
CHARME
2003
Springer
15 years 9 months ago
2003
Springer
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes o...
146
click to vote
AAAI
1996
15 years 5 months ago
1996
The Airport Example The Omelette Example Copyright c 1996 American Association for Artificial Intelligence. All rights reserved. Despite the existence of programs that are able to ...
156
click to vote
FAC
2010
15 years 1 months ago
2010
Data refinement is a common approach to reasoning about programs, based on establishing that te program indeed satisfies all the required properties imposed by an intended abstract...
136
click to vote
ICFP
2004
ACM
16 years 4 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...