1226 search results - page 34 / 246 » Proofs, Programs and Abstract Complexity |
CP
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
121
click to vote
GI
2004
Springer
15 years 7 months ago
2004
Springer
Abstract: Optimizations in compilers are the most error-prone phases in the compilation process. Since correct compilers are a vital precondition for software correctness, it is ne...
116
click to vote
AMAST
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Formal certification is based on the idea that a mathematical proof of some property of a piece of software can be regarded as a certificate of correctness which, in pr...
220
click to vote
Book
"This book has evolved from materials used in an undergraduate course intended for final year undergraduate students whose background includes at least one year's experie...
100
click to vote
CIE
2007
Springer
15 years 8 months ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...