201 search results - page 4 / 41 » An Authorization Logic With Explicit Time |
ICALP
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
KBSE
1998
IEEE
14 years 2 months ago
1998
IEEE
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...
HT
1999
ACM
14 years 3 months ago
1999
ACM
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 ...
DLOG
2008
14 years 1 months ago
2008
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...
TCS
2011
13 years 5 months ago
2011
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...