Sciweavers

5255 search results - page 648 / 1051
» Formal Methods for Privacy
Sort
View
ISOLA
2010
Springer
15 years 5 months ago
Towards an Architecture for Runtime Interoperability
Abstract. Interoperability remains a fundamental challenge when connecting heterogeneous systems which encounter and spontaneously communicate with one another in pervasive computi...
Amel Bennaceur, Gordon S. Blair, Franck Chauvel, G...
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
15 years 5 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
SAS
2010
Springer
159views Formal Methods» more  SAS 2010»
15 years 5 months ago
Automatic Abstraction for Intervals Using Boolean Formulae
c Abstraction for Intervals Using Boolean Formulae J¨org Brauer1 and Andy King2 1 Embedded Software Laboratory, RWTH Aachen University, Germany 2 Portcullis Computer Security, Pin...
Jörg Brauer, Andy King
SAS
2010
Springer
143views Formal Methods» more  SAS 2010»
15 years 5 months ago
Points-to Analysis as a System of Linear Equations
The efficiency of a points-to analysis is critical for several compiler optimizations and transformations, and has attracted considerable research attention. Despite several advanc...
Rupesh Nasre, Ramaswamy Govindarajan
SAS
2010
Springer
149views Formal Methods» more  SAS 2010»
15 years 5 months ago
Boxes: A Symbolic Abstract Domain of Boxes
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...
Arie Gurfinkel, Sagar Chaki