967 search results - page 122 / 194 » Probabilistic Predicative Programming |
129
click to vote
CADE
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
127
click to vote
LPAR
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
154
click to vote
ACSD
2001
IEEE
15 years 6 months ago
2001
IEEE
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates th...
136
Voted
VLDB
1987
ACM
15 years 6 months ago
1987
ACM
FAD is a powerful and simple language designed for a highly parallel database machine. The basic concepts of the language are its data structures (which we call objects) and its p...
116
Voted
AMAST
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Vx86 is the first static analyzer for sequential Intel x86 assembler code using automated deductive verification. It proves the correctness of assembler code against func...