923 search results - page 147 / 185 » Proving the value of formal methods |
165
click to vote
CCS
2000
ACM
15 years 10 months ago
2000
ACM
We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the wellknown simulatability approach, i.e., the specification is an ...
178
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
Abstract. We describe how the PVS verification system has been used to verify a safety property of a garbage collection algorithm, originally suggested by Ben-Ari. The safety prope...
129
click to vote
DAC
2010
ACM
15 years 10 months ago
2010
ACM
Timing exception verification has become a center of interest as incorrect constraints can lead to chip failures. Proving that a false path is valid or not is a difficult problem ...
174
click to vote
CSFW
2010
IEEE
15 years 9 months ago
2010
IEEE
We embed an operational semantics for security protocols in the interactive theorem prover Isabelle/HOL and derive two strong protocol-independent invariants. These invariants allo...
145
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Most previous logical accounts of goals do not deal with prioritized goals and goal dynamics properly. Many are restricted to achievement goals. In this paper, we develop a logica...