Sciweavers

121 search results - page 11 / 25
» Automatic verification of Java programs with dynamic frames
Sort
View
ECOOP
2008
Springer
13 years 9 months ago
Computing Stack Maps with Interfaces
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
Frédéric Besson, Thomas P. Jensen, T...
VL
2010
IEEE
247views Visual Languages» more  VL 2010»
13 years 6 months ago
Cleanroom: Edit-Time Error Detection with the Uniqueness Heuristic
Many dynamic programming language features, such as implicit declaration, reflection, and code generation, make it difficult to verify the existence of identifiers through standar...
Andrew J. Ko, Jacob O. Wobbrock
CAV
2007
Springer
108views Hardware» more  CAV 2007»
13 years 11 months ago
Parametric and Sliced Causality
Abstract. Happen-before causal partial orders have been widely used in concurrent program verification and testing. This paper presents a parametric approach to happen-before causa...
Feng Chen, Grigore Rosu
HPCA
2011
IEEE
12 years 11 months ago
Dynamic parallelization of JavaScript applications using an ultra-lightweight speculation mechanism
As the web becomes the platform of choice for execution of more complex applications, a growing portion of computation is handed off by developers to the client side to reduce net...
Mojtaba Mehrara, Po-Chun Hsu, Mehrzad Samadi, Scot...
POPL
2004
ACM
14 years 8 months ago
Atomizer: a dynamic atomicity checker for multithreaded programs
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected interactions between concurrent threads. Much previous work has focused on det...
Cormac Flanagan, Stephen N. Freund