1226 search results - page 41 / 246 » Proofs, Programs and Abstract Complexity |
125
Voted
AAECC
2005
Springer
15 years 2 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
98
Voted
FSTTCS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We present a natural confluence of higher-order hereditary Harrop formulas (HH formulas), Constraint Logic Programming (CLP, [JL87]), and Concurrent Constraint Programmi...
122
Voted
ICFP
2010
ACM
15 years 3 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
103
click to vote
ACNS
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In 2008, Groth and Sahai proposed a general methodology for constructing non-interactive zeroknowledge (and witness-indistinguishable) proofs in bilinear groups. While av...
97
Voted
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
As a general framework, UNITY does not offer any specific facility for the design of distributed systems. For such systems, distribution aspects must be represented at a low level,...