Sciweavers

429 search results - page 14 / 86
» Theorem Proving Languages for Verification
Sort
View
SP
2010
IEEE
152views Security Privacy» more  SP 2010»
13 years 6 months ago
Scalable Parametric Verification of Secure Systems: How to Verify Reference Monitors without Worrying about Data Structure Size
The security of systems such as operating systems, hypervisors, and web browsers depend critically on reference monitors to correctly enforce their desired security policy in the ...
Jason Franklin, Sagar Chaki, Anupam Datta, Arvind ...
CADE
2003
Springer
14 years 9 months ago
Proving Pointer Programs in Higher-Order Logic
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
Farhad Mehta, Tobias Nipkow
STTT
2010
113views more  STTT 2010»
13 years 3 months ago
Proved development of the real-time properties of the IEEE 1394 Root Contention Protocol with the event-B method
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: ...
Joris Rehm
ICFP
2005
ACM
14 years 8 months ago
Translating specifications from nominal logic to CIC with the theory of contexts
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
Marino Miculan, Ivan Scagnetto, Furio Honsell
DSD
2002
IEEE
102views Hardware» more  DSD 2002»
14 years 1 months ago
Formal Verification of a DSP Chip Using an Iterative Approach
In this paper we describe a methodology for the formal verification of a DSP chip using the HOL theorem prover. We used an iterative method to specify both the behavioral and stru...
Ali Habibi, Sofiène Tahar, Adel Ghazel