Sciweavers

14 search results - page 1 / 3
» Shape Analysis in the Absence of Pointers and Structure
Sort
View
VMCAI
2010
Springer
14 years 1 months ago
Shape Analysis in the Absence of Pointers and Structure
Shape analyses (Chase et al. 1990, Sagiv et al. 2002) discover properties of dynamic and/or mutable structures. We ask, "Is there an equivalent to shape analysis for purely fu...
Matthew Might
SEFM
2005
IEEE
13 years 10 months ago
Description Logics for Shape Analysis
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
Lilia Georgieva, Patrick Maier
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
13 years 10 months ago
A Scalable Nonuniform Pointer Analysis for Embedded Programs
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
Arnaud Venet
AADEBUG
1997
Springer
13 years 8 months ago
Assertions for Dynamic Shape Analysis of List Data Structures
We introduce an assertion language for run-time checking of linked list data structure shapes. The assertion language is expressive enough to define characteristic predicates for ...
Mikhail Auguston, Miu Har Hon
VMCAI
2010
Springer
14 years 1 months ago
Shape Analysis of Low-Level C with Overlapping Structures
Abstract. Device drivers often keep data in multiple data structures simultaneously while embedding list or tree related records into the records containing the actual data; this r...
Jörg Kreiker, Helmut Seidl, Vesal Vojdani