Sciweavers

80 search results - page 4 / 16
» PVS
Sort
View
CORR
2006
Springer
102views Education» more  CORR 2006»
13 years 8 months ago
A library of Taylor models for PVS automatic proof checker
We present in this paper a library to compute with Taylor models, a technique extending interval arithmetic to reduce decorrelation and to solve differential equations. Numerical s...
Francisco Cháves, Marc Daumas
POPL
2005
ACM
14 years 8 months ago
Statically checking confidentiality via dynamic labels
This paper presents a new approach for verifying confidenfor programs, based on abstract interpretation. The framework is formally developed and proved correct in the theorem prov...
Bart Jacobs, Wolter Pieters, Martijn Warnier
ARITH
2005
IEEE
14 years 2 months ago
Guaranteed Proofs Using Interval Arithmetic
This paper presents a set of tools for mechanical reasoning of numerical bounds using interval arithmetic. The tools implement two techniques for reducing decorrelation: interval ...
Marc Daumas, Guillaume Melquiond, César Mu&...
DATE
1999
IEEE
123views Hardware» more  DATE 1999»
14 years 26 days ago
Accounting for Various Register Allocation Schemes During Post-Synthesis Verification of RTL Designs
This paper reports a formal methodology for verifying a broad class of synthesized register-transfer-level (RTL) designs by accommodating various register allocation/optimization ...
Nazanin Mansouri, Ranga Vemuri
TPHOL
2008
IEEE
14 years 2 months ago
A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
Correctness of many hybrid and distributed systems require stability and convergence guarantees. Unlike the standard induction principle for verifying invariance, a theory for veri...
Sayan Mitra, K. Mani Chandy