Sciweavers

1894 search results - page 241 / 379
» A TLA Proof System
Sort
View
CRYPTO
2005
Springer
110views Cryptology» more  CRYPTO 2005»
15 years 10 months ago
Impossibility and Feasibility Results for Zero Knowledge with Public Keys
In this paper, we continue the study the round complexity of black-box zero knowledge in the bare public-key (BPK, for short) model previously started by Micali and Reyzin in [11]....
Joël Alwen, Giuseppe Persiano, Ivan Visconti
FROCOS
2005
Springer
15 years 10 months ago
Connecting a Logical Framework to a First-Order Logic Prover
We present one way of combining a logical framework and first-order logic. The logical framework is used as an interface to a first-order theorem prover. Its main purpose is to k...
Andreas Abel, Thierry Coquand, Ulf Norell
IEAAIE
2005
Springer
15 years 10 months ago
Agent Support for a Grid-Based High Energy Physics Application
Abstract. This paper presents an agent system ASGARD-0, that provides monitoring for the success or failure of Grid jobs in a High Energy Physics application. This application area...
Aman Sahani, Ian D. Mathieson, Lin Padgham
MKM
2005
Springer
15 years 10 months ago
A Tough Nut for Mathematical Knowledge Management
In this contribution we address two related questions. Firstly, we want to shed light on the question how to use a representation formalism to represent a given problem. Secondly, ...
Manfred Kerber, Martin Pollet
TPHOL
2003
IEEE
15 years 9 months ago
A Coverage Checking Algorithm for LF
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
Carsten Schürmann, Frank Pfenning