Sciweavers

61 search results - page 7 / 13
» Source-Level Proof Reconstruction for Interactive Theorem Pr...
Sort
View
GI
2001
Springer
13 years 11 months ago
Formal Analysis of a Self-Stabilizing Algorithm Using Predicate Diagrams
We present the verification of a protocol designed to ensure self-stabilization in a ring of processors. The proof is organized as a series of refinements; it is mechanized base...
Dominique Cansell, Dominique Méry, Stephan ...
ENTCS
2002
82views more  ENTCS 2002»
13 years 7 months ago
A Hybrid Encoding of Howe's Method for Establishing Congruence of Bisimilarity
We give a short description of Hybrid, a new tool for interactive theorem proving, s introduced in [4]. It provides a form of Higher Order Abstract Syntax (HOAS) combined consiste...
Alberto Momigliano, Simon Ambler, Roy L. Crole
ICFP
2006
ACM
14 years 7 months ago
Modular development of certified program verifiers with a proof assistant
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
Adam J. Chlipala
CADE
2005
Springer
14 years 7 months ago
Reflecting Proofs in First-Order Logic with Equality
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
Evelyne Contejean, Pierre Corbineau
CPP
2011
98views more  CPP 2011»
12 years 7 months ago
Automatically Verifying Typing Constraints for a Data Processing Language
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order data processing language with refinement...
Michael Backes, Catalin Hritcu, Thorsten Tarrach