Sciweavers

JFPLC
2004
13 years 8 months ago
Explications pour comprendre la trace d'un solveur de contraintes sur domaines finis
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
LPAR
2005
Springer
14 years 29 days ago
The Theorema Environment for Interactive Proof Development
Abstract. We describe an environment that allows the users of the Theorema system to flexibly control aspects of computer-supported proof development. The environment supports the...
Florina Piroi, Temur Kutsia
SAS
2009
Springer
175views Formal Methods» more  SAS 2009»
14 years 8 months ago
Automatic Parallelization and Optimization of Programs by Proof Rewriting
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
Clément Hurlin