3228 search results - page 294 / 646 » Computationally Sound Proofs |
137
click to vote
ENTCS
2007
15 years 4 months ago
2007
This paper studies the notion of “freshness” that often occurs in the meta-theory of computer science languages involving various kinds of names. Nominal Equational Logic is a...
137
click to vote
TCS
2008
15 years 4 months ago
2008
We develop a notion of spatial-behavioral typing suitable to discipline concurrent interactions and resource usage in distributed object systems. Our type structure reflects a res...
150
click to vote
ASE
2004
15 years 4 months ago
2004
In this paper, we develop model checking procedures for three ways of combining (temporal) logics: temporalization, independent combination, and join. We prove that they are termin...
110
click to vote
CACM
1999
15 years 4 months ago
1999
centralized abstractions. The metaphor of a community of independent objects communicating by passing messages is misleading and dangerous when thinking in terms of a distributed s...
137
Voted
ASIACRYPT
2010
Springer
15 years 2 months ago
2010
Springer
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...