Sciweavers

201 search results - page 4 / 41
» An Authorization Logic With Explicit Time
Sort
View
ICALP
2005
Springer
14 years 4 months ago
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...
KBSE
1998
IEEE
14 years 2 months ago
Identifying Pre-Conditions with the Z/EVES Theorem Prover
Starting from a graphical data model (a subset of the OMT object model), a skeleton of formal specification can be generated and completed to express several constraints and provi...
Yves Ledru
HT
1999
ACM
14 years 3 months ago
Do you have the Time? Composition and Linking in Time-Based Hypermedia
Most hypermedia models and systems do not incorporate time explicitly. This prevents authors from having direct control over the temporal aspects of a presentation. In this paper ...
Lynda Hardman, Jacco van Ossenbruggen, K. Sjoerd M...
DLOG
2008
14 years 1 months ago
Identifying Objects Over Time with Description Logics
A fundamental requirement for cooperating agents is to agree on a selection of component values of objects that can be used for reliably communicating references to the objects, to...
David Toman, Grant E. Weddell
TCS
2011
13 years 5 months ago
A semantic measure of the execution time in linear logic
We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...
Daniel de Carvalho, Michele Pagani, Lorenzo Tortor...