We present a connection-based characterization of propositional BI (logic of bunched implications), a logic combining linear and intuitionistic connectives. this logic, with its sharing interpretation, has been recent...
详细信息
Spass is an automated theorem prover for full first-order logic with equality. this system description provides an overview of recent developments in Spass 2.0, including among others an implementation of contextual r...
详细信息
Proof-carrying code (PCC)is a framework for ensuring that untrusted programs are safe to install and execute. When using PCC, untrusted programs are required to contain a proof that allows the program text to be check...
详细信息
Performing interactive proof in the HOL theorem prover1 [3] involves reducing goals to simpler subgoals. It turns out that many of these subgoals can be efficiently ‘finished off’ by an automatic f...
ISBN:
(纸本)3540439315
Performing interactive proof in the HOL theorem prover1 [3] involves reducing goals to simpler subgoals. It turns out that many of these subgoals can be efficiently ‘finished off’ by an automatic first-order prover. To fill this niche, Harrison implemented a version of the MESON procedure [4] withthe ability to translate proofs to higher-order logic. this was integrated as a HOL tactic in 1996, and has since become a standard workhorse of interactive proof. Today, building all the theories in the most recent distribution of HOL relies on MESON to prove 1726 subgoals.
We represent the essentialingredien ts of Shostak’s procedure at a high level of abstraction, and as a refinement of the Nelson-Oppen procedure. We analyze completeness issues of the method based on a general notion ...
详细信息
We present an algorithm for deciding Gödel-Dummett logic. the originality of this algorithm comes from the combination of proofsearch in sequent calculus, which reduces a sequent to a set of pseudoatomic sequents...
详细信息
DDDLIB is a library for manipulating formulae in a firstorder logic over Boolean variables and inequalities of the form x1−x2 ≤ d, where x1, x2 are real variables and d is an integer constant. Formulae are represente...
详细信息
We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given a program M over an infinite state type, a line...
详细信息
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiability of a CNF formula reduces to loo...
详细信息
Proof-carrying code (PCC) allows a code producer to associate to a program a machine-checkable proof of its safety. In the original approach to PCC, the safety policy includes proof rules which determine how various a...
详细信息
暂无评论