1445 search results - page 153 / 289 » Uniformly Hard Languages |
150
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
In this paper we resolve an open problem regarding resettable zero knowledge in the bare public-key (BPK for short) model: Does there exist constant round resettable zero knowledg...
162
click to vote
IGPL
2006
15 years 4 months ago
2006
Abstract. This paper addresses the problem of establishing temporal properties of programs written in languages, such as Java, that make extensive use of the heap to allocate-and d...
128
click to vote
CORR
2000
Springer
15 years 3 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
163
Voted
RWEB
2010
Springer
15 years 2 months ago
2010
Springer
Ontologies constitute formal models of some aspect of the world that may be used for drawing interesting logical conclusions even for large models. Software models capture relevant...
119
click to vote
VSTTE
2010
Springer
15 years 2 months ago
2010
Springer
Garbage collectors are very hard to implement correctly due to their low-level manipulation of memory. In this paper, we construct a copying garbage collector which we have proved ...