Add to ORKGWe present a refinement method for Java programs which is motivated by the challenge of verifying security protocol implementations. The method can be used for stepwise refinement of abstract specifications down to the level of code running in the real application. The approach is based on a calculus for the verification of Java programs for the concrete level and Abstract State Machines for the abstract level. In this paper we illustrate our approach with the verification of a MCommerce application for buying movie tickets using a mobile phone written in J2ME. The approach uses the interactive theorem prover KIV
Java development kit 1.2 provides a runtime access control mechanism which inspects a control stack ...
Designing and coding security protocols is an error prone task. Several flaws are found in protocol ...
In this paper we propose novel techniques to obfuscate Java programs for developing secure mobile ag...
We present a refinement method for Java programs which is motivated by the challenge of verifying se...
Smart cards are used in security critical applications where money or private data is involved. Exam...
In the past, formal verification of security properties of distributed applications has been mostly ...
This paper presents a methodology for automatically validating program transformation rules that are...
The objective of the lectures is to present type-based and logic-based mechanisms to ensure reliabil...
This report is concerned with the formal verification of JavaCard programs, or sequentiel Java progr...
Software are increasingly complex and are unavoidably subject toprogramming errors (a.k.a. bugs). Th...
The safety of the Java Virtual Machine is founded on bytecode verification. Although verification co...
Abstract. We present an approach to integrating the refinement relation between infinite integer typ...
Program verification is a technique for proving that a program satisfies its specification. An impor...
We present how common Java Card security properties can be formalised in Dynamic Logic and verified,...
AbstractIn previous work, an abstract certification technique for Java source code was proposed base...
Java development kit 1.2 provides a runtime access control mechanism which inspects a control stack ...
Designing and coding security protocols is an error prone task. Several flaws are found in protocol ...
In this paper we propose novel techniques to obfuscate Java programs for developing secure mobile ag...
We present a refinement method for Java programs which is motivated by the challenge of verifying se...
Smart cards are used in security critical applications where money or private data is involved. Exam...
In the past, formal verification of security properties of distributed applications has been mostly ...
This paper presents a methodology for automatically validating program transformation rules that are...
The objective of the lectures is to present type-based and logic-based mechanisms to ensure reliabil...
This report is concerned with the formal verification of JavaCard programs, or sequentiel Java progr...
Software are increasingly complex and are unavoidably subject toprogramming errors (a.k.a. bugs). Th...
The safety of the Java Virtual Machine is founded on bytecode verification. Although verification co...
Abstract. We present an approach to integrating the refinement relation between infinite integer typ...
Program verification is a technique for proving that a program satisfies its specification. An impor...
We present how common Java Card security properties can be formalised in Dynamic Logic and verified,...
AbstractIn previous work, an abstract certification technique for Java source code was proposed base...
Java development kit 1.2 provides a runtime access control mechanism which inspects a control stack ...
Designing and coding security protocols is an error prone task. Several flaws are found in protocol ...
In this paper we propose novel techniques to obfuscate Java programs for developing secure mobile ag...