Sciweavers

394 search results - page 26 / 79
» Formal polytypic programs and proofs
Sort
View
ENTCS
2008
94views more  ENTCS 2008»
13 years 8 months ago
A Formal Model of Memory Peculiarities for the Verification of Low-Level Operating-System Code
This paper presents our solutions to some problems we encountered in an ongoing attempt to verify the micro-hypervisor currently developed within the Robin project. The problems t...
Hendrik Tews, Tjark Weber, Marcus Völp
POPL
2004
ACM
14 years 8 months ago
A bisimulation for dynamic sealing
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
Eijiro Sumii, Benjamin C. Pierce
CAV
2003
Springer
140views Hardware» more  CAV 2003»
14 years 1 months ago
Certifying Optimality of State Estimation Programs
Abstract. The theme of this paper is certifying software for state estimation of dynamic systems, which is an important problem found in spacecraft, aircraft, geophysical, and in m...
Grigore Rosu, Ram Prasad Venkatesan, Jon Whittle, ...
SIGSOFT
2003
ACM
14 years 8 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer
TPHOL
1999
IEEE
14 years 7 days ago
Three Tactic Theorem Proving
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
Don Syme