Sciweavers

9405 search results - page 153 / 1881
» Computing a Model of Set Theory
Sort
View
DAGSTUHL
2006
14 years 11 months ago
A convenient category of domains
We motivate and define a category of topological domains, whose objects are certain topological spaces, generalising the usual -continuous dcppos of domain theory. Our category su...
Ingo Battenfeld, Matthias Schröder, Alex Simp...
82
Voted
AIME
2003
Springer
15 years 3 months ago
Ontology for Task-Based Clinical Guidelines and the Theory of Granular Partitions
The theory of granular partitions (TGP) is a new approach to the understanding of ontologies and other classificatory systems. The paper explores the use of this new theory in the ...
Anand Kumar, Barry Smith
95
Voted
ASIAN
2006
Springer
133views Algorithms» more  ASIAN 2006»
15 years 2 months ago
Normal Proofs in Intruder Theories
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
Vincent Bernat, Hubert Comon-Lundh
CCS
2005
ACM
15 years 3 months ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
Santiago Escobar, Catherine Meadows, José M...
103
Voted
CORR
2007
Springer
133views Education» more  CORR 2007»
14 years 10 months ago
On Decidability Properties of Local Sentences
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
Olivier Finkel