Sciweavers

2137 search results - page 59 / 428
» Proving Abstract Non-interference
Sort
View
APLAS
2001
ACM
15 years 1 months ago
Verifying the CPS Transformation in Isabelle/HOL
We verified two versions of the CPS transformation in Isabelle/HOL: one by Plotkin by Danvy and Filinski. We adopted first order abstract syntax so that the formalization is close...
Yasuhiko Minamide, Koji Okuma
AMAST
2008
Springer
15 years 19 hour ago
Long-Run Cost Analysis by Approximation of Linear Operators over Dioids
Abstract. We present a static analysis technique for modeling and approximating the long-run resource usage of programs. The approach is based on a quantitative semantic framework ...
David Cachera, Thomas P. Jensen, Arnaud Jobin, Pas...
ISQED
2010
IEEE
126views Hardware» more  ISQED 2010»
14 years 12 months ago
Modeling and verification of industrial flash memories
We present a method to abstract, formalize, and verify industrial flash memory implementations. Flash memories contain specialized transistors, e.g., floating gate and split gate d...
Sandip Ray, Jayanta Bhadra, Thomas Portlock, Ronal...
CORR
2004
Springer
85views Education» more  CORR 2004»
14 years 9 months ago
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
Patricia M. Hill, Enea Zaffanella, Roberto Bagnara
RTAS
2010
IEEE
14 years 8 months ago
Reservation-Based Interrupt Scheduling
Abstract—Some real-time kernels (such as a recent realtime version of Linux) permit to execute interrupt handlers in dedicated threads, to control their interference on realtime ...
Nicola Manica, Luca Abeni, Luigi Palopoli