Sciweavers

114 search results - page 3 / 23
» Points-To Analysis for Java using Annotated Constraints
Sort
View
CARDIS
2006
Springer
114views Hardware» more  CARDIS 2006»
13 years 9 months ago
A Low-Footprint Java-to-Native Compilation Scheme Using Formal Methods
Ahead-of-Time and Just-in-Time compilation are common ways to improve runtime performances of restrained systems like Java Card by turning critical Java methods into native code. H...
Alexandre Courbot, Mariela Pavlova, Gilles Grimaud...
CC
2011
Springer
267views System Software» more  CC 2011»
12 years 9 months ago
Using Disjoint Reachability for Parallelization
Abstract. We present a disjoint reachability analysis for Java. Our analysis computes extended points-to graphs annotated with reachability states. Each heap annotated with a set o...
James Christopher Jenista, Yong Hun Eom, Brian Dem...
CORR
2011
Springer
115views Education» more  CORR 2011»
12 years 9 months ago
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers
ibe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension ...
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amra...
ASM
2010
ASM
14 years 2 months ago
Lightweight Modeling of Java Virtual Machine Security Constraints
The Java programming language has been widely described as secure by design. Nevertheless, a number of serious security vulnerabilities have been discovered in Java, particularly i...
Mark C. Reynolds
LCTRTS
1999
Springer
13 years 9 months ago
Live Memory Analysis for Garbage Collection in Embedded Systems
Real-time garbage collection is essential if object-oriented languages (in particular, Java) are to become predictable enough for real-time embedded systems. Although techniques f...
Patrik Persson