Abstract. Result checking is a general methodology for ensuring that untrusted computations are valid. Its essence lies in defining efficient checking procedures to verify that a result satisfies some expected prop-erty. Result checking often relies on certificates to make the verification process efficient, and thus involves two strongly connected tasks: the gen-eration of certificates and the implementation of a checking procedure. Several ad-hoc solutions exist, but they differ significantly on the kind of properties involved and thus on the validation procedure. The lack of common methodologies has been an obstacle to the applicability of result checking to a more comprehensive set of algorithms. We propose the first framework for build...
Program errors are hard to detect and are costly both to programmers who spend significant efforts i...
Program errors are hard to detect and are costly both to programmers who spend significant efforts i...
The formal verification of concurrent programs is of particular importance, because concurrent progr...
Program errors are hard to detect and are costly, to both programmers who spend sig-nificant efforts...
AbstractPlover is an automated property-verifier for Haskell programs that has been under developmen...
We propose a program verification method that combines random testing, model checking and interactiv...
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyon...
We propose a method for improving confidence in the correctness of Haskell programs by combining tes...
A result checker is a program that checks the output of the computation of the observed program for ...
Abstract. We compare Haskell with Standard ML as programming languages for verification tools based ...
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyon...
Code deficiencies and bugs constitute an unavoidable part of software systems. In safety-critical sy...
Two fundamental goals in programming are correctness and efficiency: we want our programs to produce...
This dissertation discusses several problems loosely related, because they all involve a verificatio...
This thesis is about methods for establishing semantic properties of programsand how those methods c...
Program errors are hard to detect and are costly both to programmers who spend significant efforts i...
Program errors are hard to detect and are costly both to programmers who spend significant efforts i...
The formal verification of concurrent programs is of particular importance, because concurrent progr...
Program errors are hard to detect and are costly, to both programmers who spend sig-nificant efforts...
AbstractPlover is an automated property-verifier for Haskell programs that has been under developmen...
We propose a program verification method that combines random testing, model checking and interactiv...
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyon...
We propose a method for improving confidence in the correctness of Haskell programs by combining tes...
A result checker is a program that checks the output of the computation of the observed program for ...
Abstract. We compare Haskell with Standard ML as programming languages for verification tools based ...
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyon...
Code deficiencies and bugs constitute an unavoidable part of software systems. In safety-critical sy...
Two fundamental goals in programming are correctness and efficiency: we want our programs to produce...
This dissertation discusses several problems loosely related, because they all involve a verificatio...
This thesis is about methods for establishing semantic properties of programsand how those methods c...
Program errors are hard to detect and are costly both to programmers who spend significant efforts i...
Program errors are hard to detect and are costly both to programmers who spend significant efforts i...
The formal verification of concurrent programs is of particular importance, because concurrent progr...