Sciweavers

6274 search results - page 19 / 1255
» Proofs, Programs, Processes
Sort
View
TABLEAUX
1998
Springer
15 years 6 months ago
Deleting Redundancy in Proof Reconstruction
We present a framework for eliminating redundancies during the reconstruction of sequent proofs from matrix proofs. We show that search-free proof reconstruction requires knowledge...
Stephan Schmitt, Christoph Kreitz
86
Voted
IUI
2010
ACM
15 years 11 months ago
Mobia Modeler: easing the creation process of mobile applications for non-technical users
The development of mobile applications has now extended from mobile network providers into the hands of ordinary people as organizations and companies encourage people to come up ...
Florence T. Balagtas-Fernandez, Max Tafelmayer, He...
244
Voted
POPL
2009
ACM
16 years 3 months ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...
142
Voted
CHARME
2001
Springer
162views Hardware» more  CHARME 2001»
15 years 6 months ago
Parameterized Verification of the FLASH Cache Coherence Protocol by Compositional Model Checking
We consider the formal verification of the cache coherence protocol of the Stanford FLASH multiprocessor for N processors. The proof uses the SMV proof assistant, a proof system ba...
Kenneth L. McMillan
119
Voted
JAR
2010
108views more  JAR 2010»
15 years 26 days ago
Procedural Representation of CIC Proof Terms
Abstract. In this paper we propose an effective procedure for translating a proof term of the Calculus of Inductive Constructions (CIC), which is very similar to a program written...
Ferruccio Guidi