4047 search results - page 245 / 810 » Some Properties and Some Problems on Set Functors |
166
click to vote
FORMATS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We examine to what extent implementation of timed automata can be achieved using the standard semantics and appropriate modeling, instead of introducing new semantics. We...
157
click to vote
ICALP
2005
Springer
15 years 12 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 ...
151
click to vote
WOSS
2004
ACM
15 years 12 months ago
2004
ACM
We propose a high-level approach to software architecture that bridges the gap between system requirements (in the problem space) and the architectural design (in the solution spa...
193
click to vote
INFOCOM
2000
IEEE
15 years 11 months ago
2000
IEEE
—We address the issue of power-controlled shared channel access in future wireless networks supporting packetized data traffic, beyond the voice-oriented continuous traffic prima...
172
click to vote
LFCS
1994
Springer
15 years 10 months ago
1994
Springer
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...