Sciweavers

793 search results - page 110 / 159
» Argumentation and standards of proof
Sort
View
FOCS
2000
IEEE
14 years 3 months ago
Zaps and Their Applications
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
Cynthia Dwork, Moni Naor
TLCA
1999
Springer
14 years 3 months ago
Strong Normalisation of Cut-Elimination in Classical Logic
In this paper we present a strongly normalising cut-elimination procedure for classical logic. This procedure adapts Gentzen’s standard cut-reductions, but is less restrictive th...
Christian Urban, Gavin M. Bierman
WIFT
1998
IEEE
153views Hardware» more  WIFT 1998»
14 years 3 months ago
Reasoning with UML Class Diagrams
The Unified Modeling Language (UML) is likely to become an important industry standard language for modelling object-oriented systems. However, its use as a precise analysis tool ...
Andy S. Evans
SIGCSE
1997
ACM
112views Education» more  SIGCSE 1997»
14 years 3 months ago
Introducing fixed-point iteration early in a compiler course
When teaching a course in compiler design, it is conventional to introduce the iterative calculation of least fixed points quite late in the course, in the guise of iterative dat...
Max Hailperin
ICFP
1996
ACM
14 years 3 months ago
A Theory of Weak Bisimulation for Core CML
Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this paper, we build upon John Reppy's reduc...
William Ferreira, Matthew Hennessy, Alan Jeffrey