Sciweavers

29 search results - page 5 / 6
» Using First-Order Theorem Provers in the Jahob Data Structur...
Sort
View
JUCS
2006
104views more  JUCS 2006»
13 years 5 months ago
Introducing the ITP Tool: a Tutorial
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
Manuel Clavel, Miguel Palomino, Adrián Ries...
ALGORITHMICA
2004
132views more  ALGORITHMICA 2004»
13 years 5 months ago
A General Model for Authenticated Data Structures
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
Charles U. Martel, Glen Nuckolls, Premkumar T. Dev...
ICFP
2009
ACM
14 years 6 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
MKM
2004
Springer
13 years 11 months ago
Flexible Encoding of Mathematics on the Computer
This paper reports on refinements and extensions to the MathLang framework that add substantial support for natural language text. We show how the extended framework supports mult...
Fairouz Kamareddine, Manuel Maarek, J. B. Wells
ICFP
2010
ACM
13 years 6 months ago
A fresh look at programming with names and binders
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
Nicolas Pouillard, François Pottier