1226 search results - page 169 / 246 » Proofs, Programs and Abstract Complexity |
145
click to vote
DBPL
2009
Springer
16 years 22 days ago
2009
Springer
Abstract. We propose a framework in which query sizes can be estimated from arbitrary statistical assertions on the data. In its most general form, a statistical assertion states t...
164
click to vote
CONCUR
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
162
click to vote
ICALP
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
249
click to vote
TLDI
2010
ACM
16 years 3 months ago
2010
ACM
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
190
click to vote
PASTE
2005
ACM
15 years 11 months ago
2005
ACM
Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. The traditional applications of this technique have foc...