Sciweavers

670 search results - page 99 / 134
» On the Implementation of the Probabilistic Logic Programming...
Sort
View
KBSE
2005
IEEE
14 years 1 months ago
Prufrock: a framework for constructing polytypic theorem provers
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
Justin Ward, Garrin Kimmell, Perry Alexander
ICLP
1989
Springer
13 years 11 months ago
Complete and Efficient Methods for Supporting Side-effects in Independent/Restricted AND-Parallelism
It has been shown that it is possible to exploit Independent/Restricted And-parallelism in logic programs while retaining the conventional "don't know" semantics of...
Kalyan Muthukumar, Manuel V. Hermenegildo
PROVSEC
2007
Springer
14 years 1 months ago
Formal Proof of Provable Security by Game-Playing in a Proof Assistant
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
Reynald Affeldt, Miki Tanaka, Nicolas Marti
POPL
2012
ACM
12 years 3 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...
JFP
2007
111views more  JFP 2007»
13 years 7 months ago
Mechanizing metatheory in a logical framework
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this meth...
Robert Harper, Daniel R. Licata