Sciweavers

218 search results - page 22 / 44
» Verifying Safety Properties with the TLA Proof System
Sort
View
138
Voted
CSFW
2009
IEEE
15 years 7 months ago
Achieving Security Despite Compromise Using Zero-knowledge
One of the important challenges when designing and analyzing cryptographic protocols is the enforcement of security properties in the presence of compromised participants. This pa...
Michael Backes, Martin P. Grochulla, Catalin Hritc...
DAC
1997
ACM
15 years 4 months ago
Formal Verification of FIRE: A Case Study
We present our experiences with the formal verification of an automotive chip used to control the safety features in a car. We used a BDD based model checker in our work. We descr...
Jae-Young Jang, Shaz Qadeer, Matt Kaufmann, Carl P...
FCT
2003
Springer
15 years 5 months ago
Context-Sensitive Equivalences for Non-interference Based Protocol Analysis
We develop new proof techniques, based on non-interference, for the analysis of safety and liveness properties of cryptographic protocols expressed as terms of the process algebra ...
Michele Bugliesi, Ambra Ceccato, Sabina Rossi
222
Voted
POPL
2004
ACM
16 years 29 days ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
101
Voted
COORDINATION
2009
Springer
16 years 1 months ago
Assume-Guarantee Verification of Concurrent Systems
Process algebras are a set of mathematically rigourous languages with well defined semantics that permit modelling behaviour of concurrent and communicating systems. Verification o...
Liliana D'Errico, Michele Loreti