ACTA
2011
13 years 7 months ago
2011
A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies bounded overtaking. When the shared variables behave...
JCS
2007
14 years 10 days ago
2007
Information flow type systems provide an elegant means to enforce confidentiality of programs. Using the proof assistant Isabelle/HOL, we have specified an information flow ty...
JAR
2007
14 years 10 days ago
2007
The Intelligent Book project aims to improve online education by designing materials that can model the subject matter they teach, in the manner of a Reactive Learning Environment...
SAC
2006
ACM
14 years 10 days ago
2006
ACM
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...
ENTCS
2007
14 years 12 days ago
2007
This article describes an architecture for creating responsive web interfaces for proof assistants. The architecture combines current web development technologies with the functio...
ENTCS
2007
14 years 12 days ago
2007
Most of the state-of-the-art proof assistants are based on procedural proof languages, scripts, and rely on LCF tacticals as the primary tool for tactics composition. In this pape...
ENTCS
2006
14 years 13 days ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
ENTCS
2008
14 years 15 days ago
2008
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
AMAI
2006
Springer
14 years 15 days ago
2006
Springer
This paper proposes a formalization in COQ of common knowledge logic and checks its adequacy on case studies. This exercise allows exploring experimentally the proof-theoretic sid...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
High confidence in floating-point programs requires proving numerical properties of final and intermediate values. One may need to guarantee that a value stays within some range, ...