Sciweavers

3658 search results - page 106 / 732
» The logic of proofs, semantically
Sort
View
CSFW
1999
IEEE
14 years 3 months ago
Decision Procedures for the Analysis of Cryptographic Protocols by Logics of Belief
Belief-logic deductions are used in the analysis of cryptographic protocols. We show a new method to decide such logics. In addition to the familiar BAN logic, it is also applicab...
David Monniaux
AIIA
1999
Springer
14 years 2 months ago
Labelled Tableaux for Non-normal Modal Logics
In this paper we show how to extend KEM, a tableau-like proof system for normal modal logic, in order to deal with classes of non-normal modal logics, such as monotonic and regular...
Guido Governatori, Alessandro Luppi
TYPES
2007
Springer
14 years 4 months ago
A Declarative Language for the Coq Proof Assistant
This paper presents a new proof language for the Coq proof assistant. This language uses the declarative style. It aims at providing a simple, natural and robust alternative to the...
Pierre Corbineau
PPDP
2010
Springer
13 years 9 months ago
Permissive-nominal logic
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
Gilles Dowek, Murdoch James Gabbay
CALCO
2007
Springer
110views Mathematics» more  CALCO 2007»
14 years 4 months ago
Logical Semantics of Types for Concurrency
We motivate and present a logical semantic approach to types for concurrency and to the soundness of related systems. The approach is illustrated by the development of a generic ty...
Luís Caires