Filters








84 Hits in 1.2 sec

A Dynamic Operational Semantics for JVML

Nadia Belblidia, Mourad Debbabi
2007 Journal of Object Technology  
CONCLUSION AND FUTURE WORK In this paper, we reported a formalization of the dynamic semantics of JVML. The semantics comes into a small step operational style.  ...  They define an operational semantics for a JVML subset containing 9 instructions inc, pop, push, load, store, if, jsr, ret and halt.  ... 
doi:10.5381/jot.2007.6.3.a2 fatcat:yxkgre3d4ve7lng27zz4b3me7e

A simple, comprehensive type system for Java bytecode subroutines

Robert O'Callahan
1999 Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '99  
A type system with proven soundness is a prerequisite for the safe and efficient execution of Java bytecode programs.  ...  We compare it to Stata and Abadi's JVML-0 type system for bytecode subroutines, and demonstrate that our system is simpler and able to type strictly more programs, including code that could be produced  ...  A program includes the code for only a single method -there are no objects, nor a heap. The syntax and dynamic semantics are unchanged.  ... 
doi:10.1145/292540.292549 dblp:conf/popl/OCallahn99 fatcat:jfwnqe4iyvbdbhvuqikjin7b4a

A Denotational Semantic Model for Validating JVML/CLDC Optimizations under Isabelle/HOL

Hamdi Yahyaoui, Mourad Debbabi, Nadia Tawbi
2007 Seventh International Conference on Quality Software (QSIC 2007)  
The main intent of this paper is to present a semantic framework for the validation of JVML/CLDC optimizations.  ...  A case study for the validation of some optimizations of JVML/CLDC programs is also presented. The studied optimizations are: constant propagation and dead assignment elimination.  ...  The main intent of this paper is to provide a semantic framework for the validation of JVML/CLDC optimizations.  ... 
doi:10.1109/qsic.2007.4385519 fatcat:5i4cxzqjbnbv5obi4pz73zacqi

Java bytecode verification via static single assignment form

Andreas Gal, Christian W. Probst, Michael Franz
2008 ACM Transactions on Programming Languages and Systems  
It has the additional benefit of generating SSA as a side effect, which may be immediately useful for a subsequent dynamic compilation stage.  ...  Type checking at control flow merge points can then be performed in a single pass. Our prototype implementation of the new algorithm is faster than the standard JVM bytecode verifier.  ...  Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright annotation thereon. The  ... 
doi:10.1145/1377492.1377496 fatcat:lyyodkvmnrh6rfbsreze5rpkji

A formal framework for the Java bytecode language and verifier

Stephen N. Freund, John C. Mitchell
1999 SIGPLAN notices  
We also describe a prototype implementation of a type checker for our system and discuss some of the other applications of this work.  ...  This paper presents a sound type system for a large subset of the Java bytecode language including classes, interfaces, constructors, methods, exceptions, and bytecode subroutines.  ...  Figure 7 : 7 JVML f dynamic semantics (excerpts).  ... 
doi:10.1145/320385.320397 fatcat:sxepsgytkre2jcwau2u7mdurcm

A formal framework for the Java bytecode language and verifier

Stephen N. Freund, John C. Mitchell
1999 Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '99  
We also describe a prototype implementation of a type checker for our system and discuss some of the other applications of this work.  ...  This paper presents a sound type system for a large subset of the Java bytecode language including classes, interfaces, constructors, methods, exceptions, and bytecode subroutines.  ...  Figure 7 : 7 JVML f dynamic semantics (excerpts).  ... 
doi:10.1145/320384.320397 dblp:conf/oopsla/FreundM99 fatcat:knlhtny5dvgsfkk7xyoqug4mke

A type system for preventing data races and deadlocks in the java virtual machine language

Pratibha Permandla, Michael Roberson, Chandrasekhar Boyapati
2007 Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools - LCTES '07  
This paper presents static and dynamic semantics for SafeJVML. It also includes a proof that the SafeJVML type system is sound and that it prevents data races and deadlocks.  ...  Designing a corresponding type system for JVML is important because most Java code is shipped in the JVML format.  ...  Acknowledgments We thank the anonymous referees for their useful comments.  ... 
doi:10.1145/1254766.1254768 dblp:conf/lctrts/PermandlaRB07 fatcat:3oe2pcz4a5hmnffsetrjimipeq

Integrated Java Bytecode Verification

Andreas Gal, Christian W. Probst, Michael Franz
2005 Electronical Notes in Theoretical Computer Science  
Inter-adjacent transitions of a value through stack and registers are no longer verified explicitly.  ...  Our novel verification algorithm uses abstract interpretation to obtain definition/use information for each register and stack location in the program, which in turn is used to transform the program into  ...  Using these annotations and the dynamic semantics of JVML S , instructions no longer depend on the stack to connect operands to their definitions.  ... 
doi:10.1016/j.entcs.2005.01.020 fatcat:3oxqucgeqfe5bj4d7ovcmtbzyq

Ilea

Gang Tan, Greg Morrisett
2007 Proceedings of the 22nd annual ACM SIGPLAN conference on Object oriented programming systems and applications - OOPSLA '07  
Our framework includes: (1) a novel specification language, which extends the Java Virtual Machine Language (JVML) with a few primitives that approximate the effects that the C code might have; (2) an  ...  We propose ILEA (stands for Inter-LanguagE Analysis), which is a framework that enables existing Java analyses to understand the behavior of C code.  ...  Acknowledgments We are grateful to Martin Hirzel and the anonymous reviewers for their constructive comments.  ... 
doi:10.1145/1297027.1297031 dblp:conf/oopsla/TanM07 fatcat:w6smzg6tdbgsjplg7pej7ycgey

A type system for preventing data races and deadlocks in the java virtual machine language

Pratibha Permandla, Michael Roberson, Chandrasekhar Boyapati
2007 SIGPLAN notices  
This paper presents static and dynamic semantics for SafeJVML. It also includes a proof that the SafeJVML type system is sound and that it prevents data races and deadlocks.  ...  Designing a corresponding type system for JVML is important because most Java code is shipped in the JVML format.  ...  Acknowledgments We thank the anonymous referees for their useful comments.  ... 
doi:10.1145/1273444.1254768 fatcat:btvel6l2nfe6zhlbg6xbjywmmq

A type system for object initialization in the Java bytecode language

Stephen N. Freund, John C. Mitchell
1998 Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '98  
The type system is easily combined with a previous system developed by Stata and Abadi for bytecode subroutines.  ...  For this subset, we prove that for every Java bytecode program that satisfies our typing constraints, every object is initialized before it is used.  ...  We thank Li Gong for his encouragement, and Frank Yellin and Sheng Liang of JavaSoft for several useful discussions.  ... 
doi:10.1145/286936.286972 dblp:conf/oopsla/FreundM98 fatcat:qyiponfhmzfifcjhpph23qxjdm

A type system for Java bytecode subroutines

Raymie Stata, Martín Abadi
1998 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98  
Because mobile JVML code is not always trusted, a bytecode verifier enforces static constraints that prevent various dynamic errors.  ...  JVML has a subroutine construct which is used for the compilation of Java's tryfinally statement.  ...  Acknowledgements We thank Luca Cardelli, Drew Dean, Sophia Drossopoulou, Stephen Freund, Cynthia Hibbard, Mark Lillibridge, Greg Morrisett, George Necula, Frank Yellin, and anonymous referees for useful  ... 
doi:10.1145/268946.268959 dblp:conf/popl/StataA98 fatcat:iorm5dpe2vdatbgapc7y2fngee

Ilea

Gang Tan, Greg Morrisett
2007 SIGPLAN notices  
Our framework includes: (1) a novel specification language, which extends the Java Virtual Machine Language (JVML) with a few primitives that approximate the effects that the C code might have; (2) an  ...  We propose ILEA (stands for Inter-LanguagE Analysis), which is a framework that enables existing Java analyses to understand the behavior of C code.  ...  Acknowledgments We are grateful to Martin Hirzel and the anonymous reviewers for their constructive comments.  ... 
doi:10.1145/1297105.1297031 fatcat:e2zipixfznbp7o532yruxzfn3q

A type system for object initialization in the Java bytecode language

Stephen N. Freund, John C. Mitchell
1998 SIGPLAN notices  
The type system is easily combined with a previous system developed by Stata and Abadi for bytecode subroutines.  ...  For this subset, we prove, that, for every Java bytecode program that satisfies our typing constraints, every object is initialized before it is used.  ...  Fig. 2 . 2 JVML i operational semantics. Fig. 3 . 3 JVML i static semantics. Fig. 4 . 4 A JVML i program and its static type information. Fig. 5 . 5 The ConsistentInit judgment.  ... 
doi:10.1145/286942.286972 fatcat:cy5kifdflnfdle5xkcu3gp6p3m

Verification of Java Bytecode using Analysis and Transformation of Logic Programs [article]

Elvira Albert, Miguel Gómez-Zamalloa, Laurent Hubert, German Puebla
2010 arXiv   pre-print
This can be seen as a decompilation from JVML to high-level LP source.  ...  More precisely, we propose to partially evaluate a JVML interpreter implemented in LP together with (an LP representation of) a JVML program and then analyze the residual program.  ...  The authors would like to thank David Pichardie and Samir Genaim for useful discussions on the Bicolano JVM specification and on termination analysis, respectively.  ... 
arXiv:1007.3250v1 fatcat:nsbjwvptyjem7d2u2tjq4kruna
« Previous Showing results 1 — 15 out of 84 results