Sciweavers

632 search results - page 70 / 127
» Combining programming with theorem proving
Sort
View
CADE
2002
Springer
14 years 8 months ago
A Gradual Approach to a More Trustworthy, Yet Scalable, Proof-Carrying Code
Abstract. Proof-carrying code (PCC) allows a code producer to associate to a program a machine-checkable proof of its safety. In the original approach to PCC, the safety policy inc...
Robert R. Schneck, George C. Necula
BSL
2004
110views more  BSL 2004»
13 years 7 months ago
Notes on quasiminimality and excellence
This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excel...
John T. Baldwin
PPDP
2004
Springer
14 years 1 months ago
A semantics for tracing declarative multi-paradigm programs
We introduce the theoretical basis for tracing lazy functional logic computations in a declarative multi-paradigm language like Curry. Tracing computations is a difficult task due...
Bernd Brassel, Michael Hanus, Frank Huch, Germ&aac...
POPL
2012
ACM
12 years 3 months ago
Run your research: on the effectiveness of lightweight mechanization
Formal models serve in many roles in the programming language community. In its primary role, a model communicates the idea of a language design; the architecture of a language to...
Casey Klein, John Clements, Christos Dimoulas, Car...
APN
2006
Springer
13 years 10 months ago
Invariant Based Programming
Program verification is usually done by adding specifications and invariants to the program and then proving that the verification conditions are all true. This makes program verif...
Ralph-Johan Back