553 search results - page 58 / 111 » A General Theory of Additive State Space Abstractions |
POPL
2008
ACM
14 years 9 months ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
SIGUCCS
2003
ACM
14 years 1 months ago
2003
ACM
Customers of public computing sites and faculty who use the public computer classrooms to teach want diversity in computing. Inevitably, there’s a group that does not want to te...
POPL
2012
ACM
12 years 4 months ago
2012
ACM
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languages—that is, languages that combine fea...
STOC
2004
ACM
14 years 9 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
WDAG
2005
Springer
14 years 2 months ago
2005
Springer
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...