1076 search results - page 46 / 216 » Operations on proofs and labels |
IJAR
2007
13 years 7 months ago
2007
In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent...
PLDI
2009
ACM
14 years 2 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...
FOCS
2000
IEEE
13 years 11 months ago
2000
IEEE
In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certifi...
PLDI
2009
ACM
14 years 8 months ago
2009
ACM
We present an integrated proof language for guiding the actions of multiple reasoning systems as they work together to prove complex correctness properties of imperative programs....
POPL
2008
ACM
14 years 8 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...