Search For:

Displaying 1-6 out of 6 total
Collecting a heap of shapes
Found in: Proceedings of the 2013 International Symposium on Software Testing and Analysis (ISSTA 2013)
By Christian Bird, Earl T. Barr, Mark Marron
Issue Date:July 2013
pp. 123-133
The program heap is fundamentally a simple mathematical concept --- a set of objects and a connectivity relation on them. However, a large gap exists between the set of heap structures that could be constructed and those that programmers actually build. To...
     
From relational verification to SIMD loop synthesis
Found in: Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming (PPoPP '13)
By Cesar Kunz, Gilles Barthe, Juan Manuel Crespo, Mark Marron, Sumit Gulwani
Issue Date:February 2013
pp. 123-134
Existing pattern-based compiler technology is unable to effectively exploit the full potential of SIMD architectures. We present a new program synthesis based technique for auto-vectorizing performance critical innermost loops. Our synthesis technique is a...
     
Undangle: early detection of dangling pointers in use-after-free and double-free vulnerabilities
Found in: Proceedings of the 2012 International Symposium on Software Testing and Analysis (ISSTA 2012)
By Antonio Nappa, Gustavo Grieco, Juan Caballero, Mark Marron
Issue Date:July 2012
pp. 133-143
Use-after-free vulnerabilities are rapidly growing in popularity, especially for exploiting web browsers. Use-after-free (and double-free) vulnerabilities are caused by a program operating on a dangling pointer. In this work we propose early detection, a n...
     
Identification of logically related heap regions
Found in: Proceedings of the 2009 international symposium on Memory management (ISMM '09)
By Deepak Kapur, Manuel Hermenegildo, Mark Marron
Issue Date:June 2009
pp. 70-73
This paper introduces a novel set of heuristics for identifying logically related sections of the heap such as recursive data structures, objects that are part of the same multi-component structure, and related groups of objects stored in the same collecti...
     
Approximating the true evolutionary distance between two genomes
Found in: Journal of Experimental Algorithmics (JEA)
By Bernard M. E. Moret, Joel V. Earnest-Deyoung, Krister M. Swenson, Mark Marron
Issue Date:June 2008
pp. 1-22
As more and more genomes are sequenced, evolutionary biologists are becoming increasingly interested in evolution at the level of whole genomes, in scenarios in which the genome evolves through insertions, duplications, deletions, and movements of genes al...
     
Heap analysis in the presence of collection libraries
Found in: Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (PASTE '07)
By Darko Stefanovic, Deepak Kapur, Manuel Hermenegildo, Mark Marron
Issue Date:June 2007
pp. 31-36
Memory analysis techniques have become sophisticated enough to model, with a high degree of accuracy, the manipulation of simple memory structures (finite structures, single/double linked lists and trees). However, modern programming languages provide exte...
     
 1