590 search results - page 83 / 118 » Non-Failure Analysis for Logic Programs |
SIGSOFT
2007
ACM
14 years 9 months ago
2007
ACM
Checkpointing and replaying is an attractive technique that has been used widely at the operating/runtime system level to provide fault tolerance. Applying such a technique at the...
PLDI
2009
ACM
14 years 3 months ago
2009
ACM
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
ICLP
2009
Springer
14 years 9 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 ...
CADE
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...