Publication date
January 2010
DOI Publisher
Institute of Electrical and Electronics Engineers (IEEE)Abstract
10.1109/TASE.2010.24Proceedings - 2010 4th International Symposium on Theoretical Aspects of Software Engineering, TASE 201057-6
10.1109/TASE.2010.24Proceedings - 2010 4th International Symposium on Theoretical Aspects of Software Engineering, TASE 201057-6
Bytecode verification is one of the key security functions of several architectures for mobile and e...
AbstractUsing the theorem prover Isabelle/HOL we have formalized and proved correct and executable b...
Abstract. Denotational static analysis of Java bytecode has a nice and clean compositional definitio...
Ubiquitous embedded systems are often resource-constrained. Developing software for these systems sh...
Dynamic array bound checks are crucial elements for the security of a Java Virtual Machines. These d...
AbstractWe propose two control flow analyses for the Java bytecode. They safely approximate the set ...
This archive includes the release of ByteBack described in the paper: Reasoning About Exceptional Be...
costa [2] is a research prototype which performs automatic program analysis, in the style of [9, 7, ...
Using the theorem prover Isabelle/HOL we have formalized and proved correct an executable bytecode v...
Recent work in resource analysis has translated the idea of amortised resource analysis to imperativ...
We present a method to certify a subset of the Java bytecode, with respect to security. The method i...
This paper provides a comprehensive analysis of the specification, along with concrete suggestions f...
Abstract. This paper presents a formal design of a tool for statically establishing the upper bound ...
AbstractAbstract interpretation has been widely used for the analysis of object-oriented languages a...
The Java programming language requires array referen e range he ks at run time to guarantee a progr...
Bytecode verification is one of the key security functions of several architectures for mobile and e...
AbstractUsing the theorem prover Isabelle/HOL we have formalized and proved correct and executable b...
Abstract. Denotational static analysis of Java bytecode has a nice and clean compositional definitio...
Ubiquitous embedded systems are often resource-constrained. Developing software for these systems sh...
Dynamic array bound checks are crucial elements for the security of a Java Virtual Machines. These d...
AbstractWe propose two control flow analyses for the Java bytecode. They safely approximate the set ...
This archive includes the release of ByteBack described in the paper: Reasoning About Exceptional Be...
costa [2] is a research prototype which performs automatic program analysis, in the style of [9, 7, ...
Using the theorem prover Isabelle/HOL we have formalized and proved correct an executable bytecode v...
Recent work in resource analysis has translated the idea of amortised resource analysis to imperativ...
We present a method to certify a subset of the Java bytecode, with respect to security. The method i...
This paper provides a comprehensive analysis of the specification, along with concrete suggestions f...
Abstract. This paper presents a formal design of a tool for statically establishing the upper bound ...
AbstractAbstract interpretation has been widely used for the analysis of object-oriented languages a...
The Java programming language requires array referen e range he ks at run time to guarantee a progr...
Bytecode verification is one of the key security functions of several architectures for mobile and e...
AbstractUsing the theorem prover Isabelle/HOL we have formalized and proved correct and executable b...
Abstract. Denotational static analysis of Java bytecode has a nice and clean compositional definitio...
Add to ORKG