Sciweavers

1801 search results - page 18 / 361
» Pointing without a pointer
Sort
View
ICSE
2010
IEEE-ACM
14 years 11 months ago
Efficient hybrid typestate analysis by determining continuation-equivalent states
Typestate analysis determines whether a program violates a set of finite-state properties. Because the typestate-analysis problem is statically undecidable, researchers have propo...
Eric Bodden
85
Voted
ISOLA
2010
Springer
14 years 8 months ago
A Memory Model for Static Analysis of C Programs
Automatic bug finding with static analysis requires precise tracking of different memory object values. This paper describes a memory modeling method for static analysis of C pro...
Zhongxing Xu, Ted Kremenek, Jian Zhang
ECOOP
1998
Springer
15 years 1 months ago
The Complexity of Type Analysis of Object Oriented Programs
One of the price tags attached to the blessings that OO brings about is a drop in efficiency due to dynamic method dispatch. Much research effort is being spent on the problem of e...
Joseph Gil, Alon Itai
POPL
1993
ACM
15 years 1 months ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach
JOT
2006
121views more  JOT 2006»
14 years 9 months ago
Constructing persistent object-oriented models with standard C++
In this paper, it is suggested an approach and a design pattern for developing object-oriented models that need to be persistent, including the databases of moderate size, with us...
Alexander Kozynchenko