3573 search results - page 278 / 715 » Reasoning about Codata |
264
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
170
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
170
click to vote
CADE
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
173
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...
168
click to vote
ESAW
2009
Springer
16 years 1 months ago
2009
Springer
Artificial agents, people, institutes and societies all have the ability to make decisions. Decision making as a research area therefore involves a broad spectrum of sciences, ran...