1894 search results - page 358 / 379 » A TLA Proof System |
125
Voted
CADE
2007
Springer
16 years 3 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
118
Voted
ICS
2010
Tsinghua U.
16 years 4 days ago
2010
Tsinghua U.
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
133
Voted
PLPV
2009
ACM
15 years 11 months ago
2009
ACM
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
147
Voted
SAC
2010
ACM
15 years 9 months ago
2010
ACM
Embracing service-oriented architectures in the context of large systems, such as the Web, rises a set of new and challenging issues: increased size and load in terms of users and...
118
Voted
CCS
2009
ACM
15 years 9 months ago
2009
ACM
As storage-outsourcing services and resource-sharing networks have become popular, the problem of efficiently proving the integrity of data stored at untrusted servers has receiv...