Sciweavers

2137 search results - page 125 / 428
» Proving Abstract Non-interference
Sort
View
TABLEAUX
1999
Springer
15 years 7 months ago
linTAP: A Tableau Prover for Linear Logic
Abstract. linTAP is a tableau prover for the multiplicative and exponential fragment M?LL of Girards linear logic. It proves the validity of a given formula by constructing an anal...
Heiko Mantel, Jens Otten
ECAI
1998
Springer
15 years 7 months ago
The Complexity of Model Checking for Propositional Default Logics
Abstract. Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional in...
Paolo Liberatore, Marco Schaerf
FPL
1998
Springer
106views Hardware» more  FPL 1998»
15 years 7 months ago
Acceleration of Satisfiability Algorithms by Reconfigurable Hardware
Abstract. We present different architectures to solve Boolean satisfiability problems in instance-specific hardware. A simulation of these architectures shows that for examples fro...
Marco Platzner, Giovanni De Micheli
117
Voted
CSFW
1997
IEEE
15 years 7 months ago
Strategies against Replay Attacks
Abstract— Replay attacks on security protocols have been discussed for quite some time in the literature. However, the efforts to address these attacks have been largely incomple...
Tuomas Aura
KBSE
1997
IEEE
15 years 7 months ago
Distributed Cooperative Formal Methods Tools
Abstract: This paper describes some tools to support formal methods, and conversely some formal methods for developing such tools. We focus on distributed cooperative proving over ...
Joseph A. Goguen, Kai Lin, A. Mori, Grigore Rosu, ...