20 search results - page 3 / 4 » Completeness for Algebraic Theories of Local State |
116
click to vote
LICS
1998
IEEE
15 years 1 months ago
1998
IEEE
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
83
Voted
FOSSACS
2008
Springer
14 years 11 months ago
2008
Springer
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
116
click to vote
HASKELL
2009
ACM
15 years 4 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
60
Voted
EACL
1989
ACL Anthology
14 years 10 months ago
1989
ACL Anthology
In this paper we present a logical treatment of semifree word order and bounded discontinuous constituency. We extend standard feature value logics to treat word order in a single...
100
click to vote
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
Surface registration is a fundamental step in the reconstruction of three-dimensional objects. While there are several fast and reliable methods to align two surfaces, the tools a...