Sciweavers

4666 search results - page 590 / 934
» Equations on Timed Languages
Sort
View
ASIAN
1998
Springer
105views Algorithms» more  ASIAN 1998»
15 years 11 months ago
Two Flavors of Offline Partial Evaluation
Abstract. Type-directed partial evaluation is a new approach to program specialization for functional programming languages. Its merits with respect to the traditional offline part...
Simon Helsen, Peter Thiemann
194
Voted
STOC
1998
ACM
105views Algorithms» more  STOC 1998»
15 years 11 months ago
Concurrent Zero-Knowledge
Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient” verifier can be “efficiently” simulated. An outstanding open ...
Cynthia Dwork, Moni Naor, Amit Sahai
TACAS
1997
Springer
72views Algorithms» more  TACAS 1997»
15 years 11 months ago
The Term Processor Generator Kimwitu
The Kimwitu system is a meta-tool that supports the construction of programs (tools) that operate on trees or terms. The system supports open multi-paradigm programming, in that i...
Peter van Eijk, Axel Belinfante, Henk Eertink, Hen...
EURODAC
1994
IEEE
118views VHDL» more  EURODAC 1994»
15 years 11 months ago
The semantics of behavioral VHDL '93 descriptions
We present a rigorous but transparent semantic de nition of VHDL'93 covering the complete signal behavior and time model including the various wait statements and signal assi...
Wolfgang Müller 0003, Egon Börger, Uwe G...
FOCS
1992
IEEE
15 years 11 months ago
Probabilistic Checking of Proofs; A New Characterization of NP
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
Sanjeev Arora, Shmuel Safra