1133 search results - page 215 / 227 » Local Logics for Traces |
225
click to vote
POPL
2007
ACM
16 years 2 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
110
click to vote
OSDI
2004
ACM
16 years 2 months ago
2004
ACM
We present a new technique, failure-oblivious computing, that enables servers to execute through memory errors without memory corruption. Our safe compiler for C inserts checks th...
110
Voted
ICCAD
2006
IEEE
15 years 10 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
123
Voted
PDCAT
2005
Springer
15 years 7 months ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
106
Voted
ESOP
2004
Springer
15 years 7 months ago
2004
Springer
We show how to combine trust management theories with nonce-based cryptographic protocols. The strand space framework for protocol analysis is extended by associating formulas from...