1716 search results - page 173 / 344 » Proving Conditional Termination |
116
Voted
VSTTE
2010
Springer
14 years 10 months ago
2010
Springer
A suite of verification benchmarks for software verification tools and techniques, presented at VSTTE 2008 [11], provides an initial catalogue of benchmark challenges for the Verif...
119
click to vote
INDOCRYPT
2003
Springer
15 years 6 months ago
2003
Springer
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...
104
Voted
MST
2006
15 years 20 days ago
2006
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
65
Voted
SIAMCO
2000
15 years 15 days ago
2000
In this work we prove the generic simplicity of the spectrum of the clamped plate equation in a bounded regular domain of Rd. That is, given Rd, we show that there exists an arbi...
134
click to vote
CADE
2009
Springer
16 years 1 months ago
2009
Springer
In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, ...