6274 search results - page 551 / 1255 » Proofs, Programs, Processes |
225
click to vote
FSTTCS
1999
Springer
15 years 11 months ago
1999
Springer
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...
185
click to vote
COCO
1994
Springer
15 years 11 months ago
1994
Springer
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
241
click to vote
RTA
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
182
click to vote
AMAST
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Motivated by the proliferation and usefulness of Domain Specific Languages as well as the demand in enriching well established languages by high level capabilities like p...
199
click to vote
ASIAN
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. It is customary to write performance-critical parts of arithmetic functions in assembly: this enables finely-tuned algorithms that use specialized processor instructions....