Sciweavers

45 search results - page 1 / 9
» Shape Analysis of Low-Level C with Overlapping Structures
Sort
View
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
TACAS
2007
Springer
103views Algorithms» more  TACAS 2007»
13 years 10 months ago
A Reachability Predicate for Analyzing Low-Level Software
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadee...
DDEP
2000
Springer
13 years 8 months ago
GODDAG: A Data Structure for Overlapping Hierarchies
Abstract. Notations like SGML and XML represent document structures using tree structures; while this is in general a step forward from earlier systems, it creates certain difficul...
C. M. Sperberg-McQueen, Claus Huitfeldt
SAS
2007
Springer
13 years 10 months ago
Shape Analysis with Structural Invariant Checkers
Abstract. Developer-supplied data structure specifications are important to shape analyses, as they tell the analysis what information should be tracked in order to obtain the des...
Bor-Yuh Evan Chang, Xavier Rival, George C. Necula
CVPR
1999
IEEE
14 years 6 months ago
Shape from Recognition and Learning: Recovery of 3-D Face Shapes
In this paper, a novel framework for the recovery of 3D surfaces of faces from single images is developed. The underlying principle is shape from recognition, i.e. the idea that p...
Dibyendu Nandy, Jezekiel Ben-Arie