1205 search results - page 103 / 241 » Program Extraction from Large Proof Developments |
142
click to vote
APLAS
2010
ACM
15 years 17 days ago
2010
ACM
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
110
click to vote
FASE
2006
Springer
15 years 5 months ago
2006
Springer
We present an algorithm for automatic testing of distributed programs, such as Unix processes with inter-process communication and Web services. Specifically, we assume that a prog...
122
click to vote
SAT
2005
Springer
15 years 7 months ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
140
click to vote
CP
2008
Springer
15 years 3 months ago
2008
Springer
Modern computer architectures have complex features that can only be fully taken advantage of if the compiler schedules the compiled code. A standard region of code for scheduling ...
104
click to vote
LICS
2007
IEEE
15 years 7 months ago
2007
IEEE
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...