Sciweavers

923 search results - page 59 / 185
» Proving the value of formal methods
Sort
View
FMCO
2004
Springer
123views Formal Methods» more  FMCO 2004»
15 years 9 months ago
rCOS: Refinement of Component and Object Systems
Abstract. We present a model of object-oriented and component-based refinement. For object-orientation, the model is class-based and refinement is about correct changes in the stru...
Zhiming Liu, Jifeng He, Xiaoshan Li
SAS
2007
Springer
124views Formal Methods» more  SAS 2007»
16 years 6 days ago
Arithmetic Strengthening for Shape Analysis
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
Stephen Magill, Josh Berdine, Edmund M. Clarke, By...
BMCBI
2010
103views more  BMCBI 2010»
15 years 6 months ago
Nonparametric methods for the analysis of single-color pathogen microarrays
Background: The analysis of oligonucleotide microarray data in pathogen surveillance and discovery is a challenging task. Target template concentration, nucleic acid integrity, an...
Omar J. Jabado, Sean Conlan, P. Lan Quan, Jeffrey ...
ESOP
2007
Springer
15 years 10 months ago
A Certified Lightweight Non-interference Java Bytecode Verifier
Non-interference is a semantical condition on programs that guarantees the absence of illicit information flow throughout their execution, and that can be enforced by appropriate i...
Gilles Barthe, David Pichardie, Tamara Rezk
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
15 years 4 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...