769 search results - page 91 / 154 » Is Logic all in our Heads |
200
Voted
POPL
2004
ACM
16 years 1 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...
121
Voted
PLDI
2004
ACM
15 years 6 months ago
2004
ACM
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent ...
138
click to vote
SIAMCOMP
2012
13 years 3 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
187
Voted
POPL
2006
ACM
16 years 1 months ago
2006
ACM
This article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-...
117
Voted
TIME
2009
IEEE
15 years 7 months ago
2009
IEEE
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...