Sciweavers

80 search results - page 9 / 16
» PVS
Sort
View
SAC
2006
ACM
14 years 3 months ago
Provably faithful evaluation of polynomials
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ï¬...
Sylvie Boldo, César Muñoz
FMICS
2008
Springer
13 years 11 months ago
Formal Verification of the Implementability of Timing Requirements
There has been relatively little work on the implementability of timing requirements. We have previously provided definitions of fundamental timing operators that explicitly consid...
Xiayong Hu, Mark Lawford, Alan Wassyng
ENTCS
2008
94views more  ENTCS 2008»
13 years 10 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
TPHOL
2005
IEEE
14 years 3 months ago
Verifying a Secure Information Flow Analyzer
Abstract. Denotational semantics for a substantial fragment of Java is formalized by deep embedding in PVS, making extensive use of dependent types. A static analyzer for secure in...
David A. Naumann
JAVACARD
2000
14 years 1 months ago
Formal Specification and Verification of JavaCard's Application Identifier Class
Abstract This note discusses a verification in PVS of the AID (Application Identifier) class from JavaCard's API. The properties that are verified are formulated in the interf...
Joachim van den Berg, Bart Jacobs, Erik Poll