Filters








85,874 Hits in 5.1 sec

Access-based abstract memory localization in static analysis

Hakjoo Oh, Kwangkeun Yi
2013 Science of Computer Programming  
reachability-based localization. • Access-based localization is effectively realizable by employing a conservative pre-analysis. • Access-based localization is effectively applicable to arbitrary code  ...  h i g h l i g h t s • The conventional reachability-based localization is too conservative in practice. • We propose access-based localization technique and show that it is much more effective than the  ...  Conclusion In this article, we have proven that access-based localization is a decisive key to economical global static analysis based on interval domain and allocation-site-based heap abstraction.  ... 
doi:10.1016/j.scico.2013.04.002 fatcat:bfupv2wsxnfexemle6qbqj4sxi

Efficient fine-grained binary instrumentationwith applications to taint-tracking

Prateek Saxena, R Sekar, Varun Puranik
2008 Proceedings of the sixth annual IEEE/ACM international symposium on Code generation and optimization - CGO '08  
Our new static analysis enables effective optimizations, which are applied in the context of taint tracking.  ...  In contrast, source-code based techniques have achieved better performance using high level optimizations.  ...  We also note that for safe functions, statically unidentified indirect accesses to local memory should not be possible.  ... 
doi:10.1145/1356058.1356069 dblp:conf/cgo/SaxenaSP08 fatcat:62gg3bzz6rcrddwuxgmws576me

Access-Based Localization with Bypassing [chapter]

Hakjoo Oh, Kwangkeun Yi
2011 Lecture Notes in Computer Science  
Recently, access-based localization was proposed as an effective way of tightly localizing abstract memories.  ...  We present an extension of access-based localization technique to mitigate a substantial inefficiency in handling procedure calls.  ...  In experiments with an industrialized abstract interpretation-based static analyzer, our technique saved 9-79%, on average 42%, in analysis time in comparison with the access-based localization technique  ... 
doi:10.1007/978-3-642-25318-8_7 fatcat:22kl7h2p7vernbxclmph4tnfy4

Optimizing C Multithreaded Memory Management Using Thread-Local Storage [chapter]

Yair Sade, Mooly Sagiv, Ran Shaham
2005 Lecture Notes in Computer Science  
In order to reduce this overhead, we extended Hoard -a state of the art memory allocator with the ability to allocate thread-local storage.  ...  Our static analysis is sound, i.e., every detected threadlocal storage is indeed so, although we may fail to identify opportunities for allocating thread-local storage.  ...  Therefore, the paper shows that a simple sound static analysis can successfully detect heap allocation statements that can be replaced by allocating thread-local storage.  ... 
doi:10.1007/978-3-540-31985-6_10 fatcat:xsgm7tr5xzelbajtissjcdribi

Access Analysis-Based Tight Localization of Abstract Memories [chapter]

Hakjoo Oh, Lucas Brutschy, Kwangkeun Yi
2011 Lecture Notes in Computer Science  
In this article we present a new memory localization technique that is more effective than the conventional reachability-based approach.  ...  On-the-fly localization of abstract memory states is vital for economical abstract interpretation of imperative programs.  ...  Static Analysis.  ... 
doi:10.1007/978-3-642-18275-4_25 fatcat:5czhk5xjcfbtbbx6mk2t2yq5ii

Maps

Rajeev Barua, Walter Lee, Saman Amarasinghe, Anant Agarwal
1999 SIGARCH Computer Architecture News  
It optimizes for speed in two ways: by finding accesses that can be scheduled on the static interconnect through static promotion, and by minimizing dependence sequentialization for the remaining accesses  ...  The paper also shows that selective use of dynamic accesses can be a useful complement to the mostly static memory system.  ...  It allows memory accesses to be orchestrated by the compiler through the fast static network, and it enables the compiler to perform locality optimizations based on the known location of that access.  ... 
doi:10.1145/307338.300980 fatcat:uxh76ia7wranhhhvzr65mal6my

Scope-Aware Data Cache Analysis for WCET Estimation

Bach Khoa Huynh, Lei Ju, Abhik Roychoudhury
2011 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium  
Abstract interpretation-based methods (must/persistence analysis) determines possible cache conflicts based on coarse-grained memory access information from address analysis, which usually leads to significantly  ...  Based on our new persistence analysis, we propose a framework to combine access pattern analysis and abstract interpretation for accurate data cache analysis.  ...  In this work, we propose a general and accurate static data cache analysis method by combining access pattern analysis and abstract interpretation.  ... 
doi:10.1109/rtas.2011.27 dblp:conf/rtas/HuynhJR11 fatcat:adoae347djbqhmq7qpdij7wn4y

Cache analysis in presence of pointer-based data structures

Tomasz Dudziak, Jörg Herter
2011 ACM SIGBED Review  
The proposed analysis achieves precision by augmenting its abstract cache states with information about the structure of the program's allocated objects as well as a short term access history of these  ...  This paper presents ongoing work aiming at a precise cache analysis in the presence of pointerbased, heap-allocated data structures.  ...  ADAPTING CACHE ANALYSIS TO USE MEMORY ACCESS ALIASING INFORMATION We base our main cache analysis on an existing approach [6] using abstract interpretation [7] .  ... 
doi:10.1145/2038617.2038618 fatcat:vlmx2vvjsbc5dkzucaq47jjwrq

A workload extraction framework for software performance model generation

Philipp Ittershagen, Philipp A. Hartmann, Kim Grüttner, Wolfgang Nebel
2015 Proceedings of the 2015 Workshop on Rapid Simulation and Performance Evaluation Methods and Tools - RAPIDO '15  
First, the algorithmic behaviour of the embedded software is characterised statically both in terms of target processor usage and target memory access patterns, resulting in an abstracted, control flowaware  ...  In the literature, two different approaches have been proposed: Host-based simulation with abstract performance annotations, enabling fast and functional simulations with limited architectural accuracy  ...  Since we focus on memory access patterns and local CPU usage behaviour, we abstract the behaviour of an MBB to a characterization vector consisting of CPU and memory usage nodes.  ... 
doi:10.1145/2693433.2693436 dblp:conf/hipeac/IttershagenHGN15 fatcat:ah3ckjwqzrhlpcihxdsy6ver3u

Time-predictable chip-multiprocessor design

Martin Schoeberl
2010 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers  
The proposed chip-multiprocessor (CMP) uses a shared memory with a time-division multiple access (TDMA) based memory access scheduling.  ...  Experiments with a JOP based CMP showed that the memory access starts to dominate the execution time when using more than 4 processor cores.  ...  Therefore, the access to main memory has to be scheduled statically with a time-division multiple access (TDMA) based arbitration scheme.  ... 
doi:10.1109/acssc.2010.5757923 fatcat:4fklqnckwbekxltbqn63hpn5n4

WCET-Centric dynamic instruction cache locking

Huping Ding, Yun Liang, Tulika Mitra
2014 Design, Automation & Test in Europe Conference & Exhibition (DATE), 2014  
Cache locking is an effective technique to improve timing predictability in real-time systems. In static cache locking, the locked memory blocks remain unchanged throughout the program execution.  ...  Thus static locking may not be effective for large programs where multiple memory blocks are competing for few cache lines available for locking.  ...  Based on the abstract cache states, memory accesses are classified into four categories: Always Hit, Always Miss, Persistent, and Non-Classified.  ... 
doi:10.7873/date.2014.040 dblp:conf/date/DingLM14 fatcat:bwlin5d5mvbdjpimtdo4zf7glu

Time-predictable Cache Organization

Martin Schoeberl
2009 2009 Software Technologies for Future Dependable Distributed Systems  
They are hard to model for worst-case execution time (WCET) analysis. Unknown abstract cache states during the analysis result in conservative WCET bounds.  ...  Therefore, we propose to adapt the cache organization to simplify the analysis. The data cache is split into several independent caches for the stack, static data, constants, and heap allocated data.  ...  The shared main memory is accessed via a TDMA scheme, called memory wheel, similar to the TDMA based arbiter used in the JOP CMP system [15] .  ... 
doi:10.1109/stfssd.2009.10 fatcat:c675ggrxdnh4hbv3vxwyscz3hi

Strengthening Induction-Based Race Checking with Lightweight Static Analysis [chapter]

Alastair F. Donaldson, Leopold Haller, Daniel Kroening
2011 Lecture Notes in Computer Science  
We show that the applicability of k-induction can be significantly improved when combined with three inexpensive static analyses: 1) abstract-interpretation-based static analysis; 2) chunking, a domain-specific  ...  Direct Memory Access (DMA) is key to achieving high performance in system-level software for multicore processors such as the Cell Broadband Engine.  ...  Abstract interpretation-based static analysis In our experience, straightforward analysis with general-purpose abstract domains fails to establish program invariants strong enough to establish DMA race  ... 
doi:10.1007/978-3-642-18275-4_13 fatcat:hkivuk7c35ethma7fxj7xgq7du

Poster reception---ASTEX

Eric Petit, Francois Bodin, Guillaume Papaure, Florence Dru
2006 Proceedings of the 2006 ACM/IEEE conference on Supercomputing - SC '06  
The Automatic Speculative Thread EXtractor, ASTEX, construct sets of thread partitions based on hot path.  ...  This work addresses the problem of partitioning C code into threads at compile time in order to map them onto System on a chip (SoC).  ...  The mapping function is a static function that associates to an abstract memory set: an address, an offset and a memory size in the coprocessor local memory.  ... 
doi:10.1145/1188455.1188602 dblp:conf/sc/PetitBPD06 fatcat:6io5g7i4hrfsxisw25fhyinw2u

Static Timing Analysis for Hard Real-Time Systems [chapter]

Reinhard Wilhelm, Sebastian Altmeyer, Claire Burguière, Daniel Grund, Jörg Herter, Jan Reineke, Björn Wachter, Stephan Wilhelm
2010 Lecture Notes in Computer Science  
This paper provides an overview of our timing-analysis technique and in particular the methodological aspects of interest to the verification community.  ...  The architectural platform also determines the precision and the complexity of timing analysis.  ...  What is still missing is the interaction between the abstract-interpretation-based cache analysis and the BDD-based pipeline analysis.  ... 
doi:10.1007/978-3-642-11319-2_3 fatcat:jwplu7okyfckznjljrevsbqknq
« Previous Showing results 1 — 15 out of 85,874 results