1237 search results - page 193 / 248 » Abstract shade trees |
239
click to vote
POPL
2009
ACM
16 years 3 months ago
2009
ACM
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
115
click to vote
ESORICS
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. As the number and scope of government regulations and rules mandating trustworthy retention of data keep growing, businesses today are facing a higher degree of regulatio...
130
click to vote
PPOPP
2009
ACM
16 years 3 months ago
2009
ACM
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
128
click to vote
RECOMB
2005
Springer
16 years 3 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
120
click to vote
CADE
2005
Springer
16 years 3 months ago
2005
Springer
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...