429 search results - page 83 / 86 » Theorem Proving Languages for Verification |
243
Voted
POPL
2009
ACM
16 years 3 months ago
2009
ACM
Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to p...
152
click to vote
ICALP
1997
Springer
15 years 7 months ago
1997
Springer
In the 1980's, Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object's structure. In particular,...
179
click to vote
ICLP
2011
Springer
14 years 6 months ago
2011
Springer
Transaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many ad...
178
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
238
click to vote
POPL
2004
ACM
16 years 3 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...