169 search results - page 27 / 34 » Which Languages Have 4-Round Zero-Knowledge Proofs |
SEFM
2006
IEEE
14 years 1 months ago
2006
IEEE
We define a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is defin...
ISORC
1998
IEEE
13 years 11 months ago
1998
IEEE
Many modern chemical plants have to be modelled as complex hybrid systems consisting of various continuous and event-discrete components. Besides of the modular and easy-to-read s...
FASE
2008
Springer
13 years 9 months ago
2008
Springer
For a number of programming languages, among them Eiffel, C, Java and Ruby, Hoare-style logics and dynamic logics have been developed. In these logics, pre- and postconditions are ...
ICALP
2003
Springer
14 years 22 days ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
POPL
2010
ACM
14 years 4 months ago
2010
ACM
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...