Sciweavers

446 search results - page 37 / 90
» A Theorem Prover for a Computational Logic
Sort
View
AISC
2010
Springer
15 years 2 months ago
Formal Proof of SCHUR Conjugate Function
Abstract. The main goal of our work is to formally prove the correctness of the key commands of the SCHUR software, an interactive program for calculating with characters of Lie gr...
Franck Butelle, Florent Hivert, Micaela Mayero, Fr...
CADE
2006
Springer
15 years 10 months ago
Blocking and Other Enhancements for Bottom-Up Model Generation Methods
In this paper we introduce several new improvements to the bottom-up model generation (BUMG) paradigm. Our techniques are based on non-trivial transformations of first-order probl...
Peter Baumgartner, Renate A. Schmidt
IGPL
2007
107views more  IGPL 2007»
14 years 9 months ago
Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs
This work studies the structure of proofs containing non-analytic cuts in the cut-based system, a sequent inference system in which the cut rule is not eliminable and the only bra...
Marcelo Finger, Dov M. Gabbay
JACM
2002
163views more  JACM 2002»
14 years 9 months ago
Formal verification of standards for distance vector routing protocols
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gu...
ENTCS
2007
87views more  ENTCS 2007»
14 years 9 months ago
Temporal Logics of Knowledge and their Applications in Security
Temporal logics of knowledge are useful for reasoning about situations where the knowledge of an agent or component is important, and where change in this knowledge may occur over...
Clare Dixon, M. Carmen Fernández Gago, Mich...