805 search results - page 145 / 161 » On the Semantics of Conditional Commitment |
167
click to vote
POPL
2004
ACM
15 years 9 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
182
Voted
POPL
2003
ACM
15 years 9 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
PODS
2007
ACM
15 years 9 months ago
2007
ACM
Schema mappings are high-level specifications that describe the relationship between two database schemas. Two operators on schema mappings, namely the composition operator and th...
ICDCS
2006
IEEE
15 years 3 months ago
2006
IEEE
Byzantine quorum systems have been proposed that work properly even when up to f replicas fail arbitrarily. However, these systems are not so successful when confronted with Byzan...
CONTEXT
2005
Springer
15 years 3 months ago
2005
Springer
In a series of recent articles Angelika Kratzer has argued that the standard account of modality along Kripkean lines is inadequate in order to represent context-dependent modals. ...