4192 search results - page 583 / 839 » Probabilistic Logic Programming |
127
click to vote
ICAI
2004
15 years 5 months ago
2004
This paper shows how to generate an English step-by-step explanation that describes how an automated reasoning system solves a complex logic program. We limit our attention to pro...
146
click to vote
SIGSOFT
2007
ACM
16 years 4 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...
246
Voted
POPL
2009
ACM
16 years 4 months ago
2009
ACM
We present a proof calculus and method for the static verification of assertions and procedure specifications in shared-memory concurrent programs. The key idea in our approach is...
232
click to vote
POPL
2007
ACM
16 years 4 months ago
2007
ACM
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...
138
click to vote
PLDI
2010
ACM
16 years 1 months ago
2010
ACM
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...