Sciweavers

Share
ACTA
2011
8 years 3 months ago
Nonatomic dual bakery algorithm with bounded tokens
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...
Alex A. Aravind, Wim H. Hesselink
JCS
2007
80views more  JCS 2007»
8 years 8 months ago
Secure information flow for a concurrent language with scheduling
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...
Gilles Barthe, Leonor Prensa Nieto
JAR
2007
104views more  JAR 2007»
8 years 8 months ago
Student Proof Exercises Using MathsTiles and Isabelle/HOL in an Intelligent Book
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...
William Billingsley, Peter Robinson
SAC
2006
ACM
8 years 8 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...
ENTCS
2007
82views more  ENTCS 2007»
8 years 8 months ago
Web Interfaces for Proof Assistants
This article describes an architecture for creating responsive web interfaces for proof assistants. The architecture combines current web development technologies with the functio...
Cezary Kaliszyk
ENTCS
2007
86views more  ENTCS 2007»
8 years 8 months ago
Tinycals: Step by Step Tacticals
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...
Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacc...
ENTCS
2006
113views more  ENTCS 2006»
8 years 8 months ago
A Large-Scale Experiment in Executing Extracted Programs
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...
Luís Cruz-Filipe, Pierre Letouzey
ENTCS
2008
170views more  ENTCS 2008»
8 years 8 months ago
A Coq Library for Verification of Concurrent Programs
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
Reynald Affeldt, Naoki Kobayashi
AMAI
2006
Springer
8 years 8 months ago
Mechanizing common knowledge logic using COQ
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...
Pierre Lescanne
CORR
2008
Springer
105views Education» more  CORR 2008»
8 years 8 months ago
Certifying floating-point implementations using Gappa
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, ...
Florent de Dinechin, Christoph Quirin Lauter, Guil...
books