Sciweavers

344 search results - page 35 / 69
» Some Theorems We Should Prove
Sort
View
ITP
2010
230views Mathematics» more  ITP 2010»
13 years 9 months ago
On the Formalization of the Lebesgue Integration Theory in HOL
Lebesgue integration is a fundamental concept in many mathematical theories, such as real analysis, probability and information theory. Reported higher-order-logic formalizations o...
Tarek Mhamdi, Osman Hasan, Sofiène Tahar
SIGSOFT
1994
ACM
13 years 11 months ago
Foundations of Software Testing: Dependability Theory
Testing is potentially the best grounded part of software engineering, since it deals with the well defined situation of a fixed program and a test (a finite collection of input v...
Richard G. Hamlet
CONCUR
2012
Springer
11 years 9 months ago
Linearizability with Ownership Transfer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
Alexey Gotsman, Hongseok Yang
FOCM
2008
100views more  FOCM 2008»
13 years 7 months ago
A Unifying Local Convergence Result for Newton's Method in Riemannian Manifolds
We consider the problem of finding a singularity of a differentiable vector field X defined on a complete Riemannian manifold. We prove a unified result for the existence and local...
Felipe Alvarez, Jérôme Bolte, Julien ...
ENTCS
2007
98views more  ENTCS 2007»
13 years 7 months ago
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
Jesper Bengtson, Joachim Parrow