3552 search results - page 12 / 711 » Proof theory in the abstract |
CADE
2008
Springer
16 years 2 months ago
2008
Springer
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
135
Voted
ESORICS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We define a framework to reason about implementations of equational theories in the presence of an adaptive adversary. We particularly focus on soundess of static equiva...
106
Voted
FLOPS
2006
Springer
15 years 5 months ago
2006
Springer
Pocklington certificates are known to provide short proofs of primality. We show how to perform this in the framework of formal, mechanically checked, proofs. We present an encodin...
136
click to vote
TPHOL
2008
IEEE
15 years 8 months ago
2008
IEEE
g to the well-known “LCF approach” of secure inferences as abstract datatype constructors in ML [16]; explicit proof terms are also available [8]. Isabelle/Isar provides sophis...
109
click to vote
TASE
2009
IEEE
15 years 8 months ago
2009
IEEE
Population protocols are an elegant model recently introduced for distributed algorithms running in large and unreliable networks of tiny mobile agents. Correctness proofs of such...