Sciweavers

103 search results - page 6 / 21
» Algebraic Methods for Interactive Proof Systems
Sort
View
TCS
2008
15 years 2 months ago
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
Jean-François Dufourd
ECBS
2003
IEEE
145views Hardware» more  ECBS 2003»
15 years 7 months ago
Model Checking and Evidence Exploration
We present an algebraic framework for evidence exploration: the process of interpreting, manipulating, and navigating the proof structure or evidence produced by a model checker w...
Yifei Dong, C. R. Ramakrishnan, Scott A. Smolka
162
Voted
ICFP
2006
ACM
16 years 2 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
199
Voted
COGSYS
2005
Springer
15 years 4 months ago
Natural Language Dialog with a Tutor System for Mathematical Proofs
Abstract. Natural language interaction between a student and a tutoring or an assistance system for mathematics is a new multi-disciplinary challenge that requires the interaction ...
Christoph Benzmüller, Helmut Horacek, Ivana K...
117
Voted
JCS
2010
121views more  JCS 2010»
15 years 28 days ago
Computational soundness of symbolic zero-knowledge proofs
raction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently significa...
Michael Backes, Dominique Unruh