Sciweavers

99 search results - page 4 / 20
» Proving Self-Stabilization with a Proof Assistant
Sort
View
FLOPS
2006
Springer
13 years 11 months ago
Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant
Abstract. We present a practical tool for defining and proving properties of recursive functions in the Coq proof assistant. The tool generates from pseudo-code the graph of the in...
Gilles Barthe, Julien Forest, David Pichardie, Vla...
TPHOL
2005
IEEE
14 years 1 months ago
Real Number Calculations and Theorem Proving
Wouldn’t it be nice to be able to conveniently use ordinary real number expressions within proof assistants? In this paper we outline how this can be done within a theorem provin...
César Muñoz, David Lester
EGCDMAS
2004
147views ECommerce» more  EGCDMAS 2004»
13 years 9 months ago
Should We Prove Security Policies Correct?
Security policies are abstract descriptions of how a system should behave to be secure. They typically express what is obligatory, permitted, or forbidden in the system. When the s...
Sebastiano Battiato, Giampaolo Bella, Salvatore Ri...
IUI
2010
ACM
14 years 2 months ago
Intelligent understanding of handwritten geometry theorem proving
Computer-based geometry systems have been widely used for teaching and learning, but largely based on mouse-andkeyboard interaction, these systems usually require users to draw fi...
Yingying Jiang, Feng Tian, Hongan Wang, Xiaolong Z...
JAR
2002
77views more  JAR 2002»
13 years 7 months ago
Proof Reflection in Coq
We formalise natural deduction for first-order logic in the proof assistant Coq, using De Bruijn indices for variable binding. The main judgement we model is of the form d [:] , ...
Dimitri Hendriks