Sciweavers

203 search results - page 33 / 41
» Proof Reflection in Coq
Sort
View
ASIAN
2006
Springer
118views Algorithms» more  ASIAN 2006»
13 years 11 months ago
An Approach to Formal Verification of Arithmetic Functions in Assembly
Abstract. It is customary to write performance-critical parts of arithmetic functions in assembly: this enables finely-tuned algorithms that use specialized processor instructions....
Reynald Affeldt, Nicolas Marti
ENTCS
2008
93views more  ENTCS 2008»
13 years 7 months ago
Rewriting Interpolants
Abstract. We give a method of constructing an interpolant for linear equality, and inequality constraints over the rational numbers. Our method is based on efficient rewriting tech...
Christopher Lynch, Yuefeng Tang
TPHOL
2007
IEEE
14 years 1 months ago
Using XCAP to Certify Realistic Systems Code: Machine Context Management
Formal, modular, and mechanized verification of realistic systems code is desirable but challenging. Verification of machine context management (a basis of multi-tasking) is one ...
Zhaozhong Ni, Dachuan Yu, Zhong Shao
TPHOL
2005
IEEE
14 years 1 months ago
A HOL Theory of Euclidean Space
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
John Harrison
ENTCS
2008
137views more  ENTCS 2008»
13 years 7 months ago
Computerizing Mathematical Text with MathLang
Mathematical texts can be computerized in many ways that capture differing amounts of the mathematical meaning. At one end, there is document imaging, which captures the arrangeme...
Fairouz Kamareddine, J. B. Wells