97 search results - page 14 / 20 » A Generalized Gelfond-Lifschitz Transformation for Logic Pro... |
PPDP
2005
Springer
14 years 26 days ago
2005
Springer
fects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type and eff...
POPL
2012
ACM
12 years 3 months ago
2012
ACM
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...
ICLP
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. The overhead of matching CHR rules is alleviated by constraint store indexing. Attributed variables provide an efficient means of indexing on logical variables. Existing ...
DRM
2007
Springer
14 years 1 months ago
2007
Springer
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
ICLP
1994
Springer
13 years 11 months ago
1994
Springer
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...