798 search results - page 73 / 160 » Proving More Properties with Bounded Model Checking |
162
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
Many protocols are designed to operate correctly even in the case where the underlying communication medium is faulty. To capture the behaviour of such protocols, lossy channel sy...
149
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We show that quantum circuits cannot be made faulttolerant against a depolarizing noise level of ˆθ = (6 − 2 √ 2)/7 ≈ 45%, thereby improving on a previous bound of 50% (du...
132
click to vote
ECOOP
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
153
click to vote
IJAIT
2006
15 years 4 months ago
2006
We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof obligatio...
141
click to vote
ACTA
2007
15 years 4 months ago
2007
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...