1894 search results - page 135 / 379 » A TLA Proof System |
119
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We study rational streams (over a field) from a coalgebraic perspective. Exploiting the finality of the set of streams, we present an elementary and uniform proof of the ...
116
Voted
APLAS
2009
ACM
15 years 10 months ago
2009
ACM
Handling concurrency using a shared memory and locks is tedious and error-prone. One solution is to use message passing instead. We study here a particular, contract-based flavor ...
117
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
d abstract) Nathan Segerlind∗ Sam Buss† Russell Impagliazzo‡ We prove a new switching lemma that works for restrictions that set only a small fraction of the variables and i...
139
Voted
CIA
2000
Springer
15 years 8 months ago
2000
Springer
Effective development of nontrivial systems of collaborative information agents requires that an in-depth analysis is made resulting in (1) specification of requirements at differe...
135
Voted
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
In this paper, we show the optimality of a certain class of disturbance-affine control policies in the context of one-dimensional, constrained, multi-stage robust optimization. Ou...