Sciweavers

989 search results - page 43 / 198
» Pebbling and Proofs of Work
Sort
View
SIGADA
2005
Springer
14 years 1 months ago
Optimizing the SPARK program slicer
Recent trends in software re-engineering have included tools to extract program slices from existing Ada procedures. One such tool has already been developed that extracts program...
Ricky E. Sward, Leemon C. Baird III
FM
2006
Springer
134views Formal Methods» more  FM 2006»
13 years 12 months ago
Formal Verification of a C Compiler Front-End
This paper presents the formal verification of a compiler front-end that translates a subset of the C language into the Cminor intermediate language. The semantics of the source an...
Sandrine Blazy, Zaynah Dargaye, Xavier Leroy
CCCG
2004
13 years 9 months ago
On corners of objects built from parallelepiped bricks
We investigate a question initiated in the work of Sibley and Wagon, who proved that 3 colors suffice to color any collection of 2D parallelograms glued edge-to-edge. Their proof ...
Mirela Damian, Joseph O'Rourke
JFPLC
2004
13 years 9 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...
ENTCS
2008
121views more  ENTCS 2008»
13 years 8 months ago
Building Certified Static Analysers by Modular Construction of Well-founded Lattices
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
David Pichardie