Sciweavers

12774 search results - page 382 / 2555
» A Framework for Proof Systems
Sort
View
MKM
2005
Springer
16 years 11 days ago
Computational Origami of a Morley's Triangle
Abstract. We present a computational origami construction of Morley’s triangles and automated proof of correctness of the generalized Morley’s theorem in a streamlined process ...
Tetsuo Ida, Hidekazu Takahashi, Mircea Marin
ICTAC
2004
Springer
16 years 8 days ago
Verifying OWL and ORL Ontologies in PVS
The Semantic Web vision is being realized to reach the full potential of the Web. Semantic data modeling is the foundation of the Semantic Web. The Web Ontology Language (OWL) and ...
Jin Song Dong, Yuzhang Feng, Yuan-Fang Li
MPC
2004
Springer
97views Mathematics» more  MPC 2004»
16 years 7 days ago
Friends Need a Bit More: Maintaining Invariants Over Shared State
A friendship system is introduced for modular static verification of object invariants. It extends a previous methodology, based on ownership hierarchy encoded in auxiliary state,...
Michael Barnett, David A. Naumann
TCC
2004
Springer
100views Cryptology» more  TCC 2004»
16 years 7 days ago
On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes
In earlier work, we described a “pathological” example of a signature scheme that is secure in the Random Oracle Model, but for which no secure implementation exists. For that...
Ran Canetti, Oded Goldreich, Shai Halevi
FOCS
2002
IEEE
15 years 12 months ago
Concurrent Zero Knowledge with Logarithmic Round-Complexity
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
Manoj Prabhakaran, Alon Rosen, Amit Sahai