Sciweavers

2496 search results - page 248 / 500
» Error-detecting properties of languages
Sort
View
POPL
2004
ACM
16 years 7 months ago
Abstractions from proofs
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
137
Voted
CADE
2001
Springer
16 years 7 months ago
Canonical Propositional Gentzen-Type Systems
Canonical propositional Gentzen-type systems are systems which in addition to the standard axioms and structural rules have only pure logical rules with the subformula property, in...
Arnon Avron, Iddo Lev
PLDI
2010
ACM
16 years 4 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
127
Voted
ECIR
2009
Springer
16 years 3 months ago
Choosing the Best MT Programs for CLIR Purposes - Can MT Metrics Be Helpful?
Abstract. This paper describes usage of MT metrics in choosing the best candidates for MT-based query translation resources. Our main metrics is METEOR, but we also use NIST and BL...
Kimmo Kettunen
127
Voted
ESOP
2009
Springer
16 years 1 months ago
SingleTrack: A Dynamic Determinism Checker for Multithreaded Programs
Abstract. Multithreaded programs are prone to errors caused by unintended interference between concurrent threads. This paper focuses on verifying that deterministically-parallel c...
Caitlin Sadowski, Stephen N. Freund, Cormac Flanag...