Sciweavers

119 search results - page 3 / 24
» Assertion Application in Theorem Proving and Proof Planning
Sort
View
CL
2000
Springer
13 years 9 months ago
Proof Planning with Multiple Strategies
The control in multi-strategy proof planning goes beyond the control in other automated theorem proving approaches: not only the selection of the inference and the facts for the n...
Erica Melis, Andreas Meier
CSFW
2006
IEEE
13 years 11 months ago
Cryptographically Sound Theorem Proving
We describe a faithful embedding of the Dolev-Yao model of Backes, Pfitzmann, and Waidner (CCS 2003) in the theorem prover Isabelle/HOL. This model is cryptographically sound in ...
Christoph Sprenger, Michael Backes, David A. Basin...
FMCAD
2008
Springer
13 years 6 months ago
Mechanized Information Flow Analysis through Inductive Assertions
We present a method for verifying information flow properties of software programs using inductive assertions and theorem proving. Given a program annotated with information flow a...
Warren A. Hunt Jr., Robert Bellarmine Krug, Sandip...
JAMDS
2002
60views more  JAMDS 2002»
13 years 5 months ago
A simple proof of Suzumura's extension theorem for finite domains with applications
Abstract. In this paper we provide a simple proof of the extension theorem for partial orderings due to Suzumura [1983] when the domain of the partial order is finite. The extensio...
Somdeb Lahiri
CADE
2009
Springer
14 years 6 months ago
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...
Sean McLaughlin, Frank Pfenning