ICS '96 Proceedings of the 10th international conference on Supercomputing
Region-based memory management
Information and Computation
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Pointer and escape analysis for multithreaded programs
PPoPP '01 Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming
Automated discovery of scoped memory regions for real-time Java
Proceedings of the 3rd international symposium on Memory management
Principles of Program Analysis
Principles of Program Analysis
The Real-Time Specification for Java
The Real-Time Specification for Java
Data Flow Analysis for Software Prefetching Linked Data Structures in Java
Proceedings of the 2001 International Conference on Parallel Architectures and Compilation Techniques
Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems
Region analysis and transformation for Java programs
Proceedings of the 4th international symposium on Memory management
JScoper: Eclipse support for research on scoping and instrumentation for real time Java applications
eclipse '05 Proceedings of the 2005 OOPSLA workshop on Eclipse technology eXchange
Improving abstraction, encapsulation, and performance within mixed-mode real-time Java applications
JTRES '07 Proceedings of the 5th international workshop on Java technologies for real-time and embedded systems
Semi-Automatic Region-Based Memory Management for Real-Time Java Embedded Systems
RTCSA '07 Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
The Daikon system for dynamic detection of likely invariants
Science of Computer Programming
Parametric prediction of heap memory requirements
Proceedings of the 7th international symposium on Memory management
Analysing memory resource bounds for low-level programs
Proceedings of the 7th international symposium on Memory management
Live heap space analysis for languages with garbage collection
Proceedings of the 2009 international symposium on Memory management
Program Instrumentation and Run-Time Analysis of Scoped Memory in Java
Electronic Notes in Theoretical Computer Science (ENTCS)
Fast Escape Analysis for Region-based Memory Management
Electronic Notes in Theoretical Computer Science (ENTCS)
Cost analysis of java bytecode
ESOP'07 Proceedings of the 16th European conference on Programming
Memory usage verification for OO programs
SAS'05 Proceedings of the 12th international conference on Static Analysis
Making the common case the only case with anticipatory memory allocation
FAST'11 Proceedings of the 9th USENIX conference on File and stroage technologies
Scheduling real-time garbage collection on uniprocessors
ACM Transactions on Computer Systems (TOCS)
Making the common case the only case with anticipatory memory allocation
ACM Transactions on Storage (TOS)
Region-Based RTSJ Memory Management: State of the art
Science of Computer Programming
Probabilistic symbolic execution
Proceedings of the 2012 International Symposium on Software Testing and Analysis
| Hi-index | 0.00 |
The ScopedMemory class of the RTSJ enables the organization of objects into regions. This ensures time-predictable management of dynamic memory. Using scopes forces the programmer to reason in terms of locality, to comply with RTSJ restrictions. The programmer is also faced with the problem of providing upper-bounds for regions. Without appropriate compile-time support, scoped-memory management may lead to unexpected runtime errors. This work presents the integration of a series of compile-time analysis techniques to help identifying memory regions, their sizes, and overall memory usage. First, the tool synthesizes a scoped-based memory organization where regions are associated with methods. Second, it infers their sizes in parametric forms in terms of relevant program variables. Third, it exhibits a parametric upper-bound on the total amount of memory required to run a method. We present some preliminary results showing that semi-automatic, tool-assisted generation of scoped-based code is both helpful and doable.