Sciweavers

981 search results - page 18 / 197
» Symbolic pointer analysis
Sort
View
ACMMSP
2005
ACM
101views Hardware» more  ACMMSP 2005»
14 years 2 months ago
Transparent pointer compression for linked data structures
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
Chris Lattner, Vikram S. Adve
FAC
2010
121views more  FAC 2010»
13 years 6 months ago
Blaming the client: on data refinement in the presence of pointers
Data refinement is a common approach to reasoning about programs, based on establishing that te program indeed satisfies all the required properties imposed by an intended abstract...
Ivana Filipovic, Peter W. O'Hearn, Noah Torp-Smith...
ESOP
2010
Springer
14 years 6 months ago
Fluid Updates: Beyond Strong vs. Weak Updates
Abstract. We describe a symbolic heap abstraction that unifies reasoning about arrays, pointers, and scalars, and we define a fluid update operation on this symbolic heap that rela...
Isil Dillig, Thomas Dillig and Alex Aiken
ICDAR
2011
IEEE
12 years 8 months ago
Digit/Symbol Pruning and Verification for Arabic Handwritten Digit/Symbol Spotting
—In order to spot the digits in a handwritten document, each component is sent to a classifier. This is a time consuming process because a document usually contains several hundr...
Nicola Nobile, Chun Lei He, Malik Waqas Sagheer, L...

Publication
103views
13 years 10 months ago
How to Use Vectors for Representing Ground Expressions in the Implementations of the Language Refal
Most implementations of the language Refal represent ground expressions by doubly-linked lists, which results in low-cost concatenation. On the other hand, that representation nece...
Sergei M. Abramov, Sergei A. Romanenko