3513 search results - page 310 / 703 » Super Logic Programs |
145
click to vote
ROBOCUP
2000
Springer
15 years 7 months ago
2000
Springer
Building agents for a scenario such as the RoboCup simulation league requires not only methodologies for implementing high-level complex behavior, but also the careful and efficien...
236
click to vote
POPL
2008
ACM
16 years 4 months ago
2008
ACM
Translation validation consists of transforming a program and a posteriori validating it in order to detect a modification of its semantics. This approach can be used in a verifie...
151
click to vote
ESOP
2005
Springer
15 years 9 months ago
2005
Springer
Program slicing is a well-known methodology that aims at identifying the program statements that (potentially) affect the values computed at some point of interest. Within imperat...
128
click to vote
ICFP
2000
ACM
15 years 8 months ago
2000
ACM
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
140
click to vote
POPL
2010
ACM
15 years 4 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...