Sciweavers

30 search results - page 5 / 6
» Formalizing Desargues' theorem in Coq using ranks
Sort
View
MKM
2007
Springer
14 years 3 months ago
Narrative Structure of Mathematical Texts
Abstract. There are many styles for the narrative structure of a mathematical document. Each mathematician has its own conventions and traditions about labeling portions of texts (...
Fairouz Kamareddine, Manuel Maarek, Krzysztof Rete...
PEPM
2010
ACM
13 years 11 months ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...
SAC
2006
ACM
13 years 9 months ago
Assisted verification of elementary functions using Gappa
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
Florent de Dinechin, Christoph Quirin Lauter, Guil...
ESORICS
2010
Springer
13 years 11 months ago
Enforcing Secure Object Initialization in Java
Sun and the CERT recommend for secure Java development to not allow partially initialized objects to be accessed. The CERT considers the severity of the risks taken by not followin...
Laurent Hubert, Thomas P. Jensen, Vincent Monfort,...
CADE
2002
Springer
14 years 10 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