Sciweavers

458 search results - page 69 / 92
» Symbolic Object Code Analysis
Sort
View
IANDC
2011
127views more  IANDC 2011»
13 years 4 months ago
On the consistency, expressiveness, and precision of partial modeling formalisms
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
Ou Wei, Arie Gurfinkel, Marsha Chechik
POPL
2008
ACM
14 years 10 months ago
Automatic inference of stationary fields: a generalization of java's final fields
Java programmers can document that the relationship between two objects is unchanging by declaring the field that encodes that relationship to be final. This information can be us...
Christopher Unkel, Monica S. Lam
UIST
2004
ACM
14 years 3 months ago
Hierarchical parsing and recognition of hand-sketched diagrams
A long standing challenge in pen-based computer interaction is the ability to make sense of informal sketches. A main difficulty lies in reliably extracting and recognizing the i...
Levent Burak Kara, Thomas F. Stahovich
ISSRE
2003
IEEE
14 years 3 months ago
Investigating Java Type Analyses for the Receiver-Classes Testing Criterion
This paper investigates the precision of three linearcomplexity type analyses for Java software: Class Hierarchy Analysis (CHA), Rapid Type Analysis (RTA) and Variable Type Analys...
Pierre-Luc Brunelle, Ettore Merlo, Giuliano Antoni...
LPAR
2010
Springer
13 years 7 months ago
Verifying Pointer and String Analyses with Region Type Systems
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...
Lennart Beringer, Robert Grabowski, Martin Hofmann