Results 1  10
of
22
A Theorem Proving Approach to Analysis of Secure Information Flow
, 2003
"... Most attempts at analysing secure information flow in programs are based on domainspecific logics. Though computationally feasible, these approaches suffer from the need for abstraction and the high cost of building dedicated tools for real programming languages. We recast the information flow prob ..."
Abstract

Cited by 105 (10 self)
 Add to MetaCart
Most attempts at analysing secure information flow in programs are based on domainspecific logics. Though computationally feasible, these approaches suffer from the need for abstraction and the high cost of building dedicated tools for real programming languages. We recast the information flow problem in a general program logic rather than a problemspecific one. We investigate the feasibility of this approach by showing how a general purpose tool for software verification can be used to perform information ow analyses. We are able to handle phenomena like method calls, loops, and object types for the target language Java Card. We are also able to prove insecurity of programs.
Formalisation and verification of Java Card security properties in dynamic logic
 PROC. FUNDAMENTAL APPROACHES TO SOFTWARE ENGINEERING (FASE), EDINBURGH, VOLUME 3442 OF LNCS
, 2005
"... We present how common JAVA CARD security properties can be formalised in Dynamic Logic and verified, mostly automatically, with the KeY system. The properties we consider, are a large subset of properties that are of importance to the smart card industry. We discuss the properties one by one, illus ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
(Show Context)
We present how common JAVA CARD security properties can be formalised in Dynamic Logic and verified, mostly automatically, with the KeY system. The properties we consider, are a large subset of properties that are of importance to the smart card industry. We discuss the properties one by one, illustrate them with examples of reallife, industrial size, JAVA CARD applications, and show how the properties are verified with the KeY Prover – an interactive theorem prover for JAVA CARD source code based on a version of Dynamic Logic that models the full JAVA CARD standard. We report on the experience related to formal verification of JAVA CARD programs we gained during the course of this work. Thereafter, we present the current state of the art of formal verification techniques offered by the KeY system and give an assessment of interactive theorem proving as an alternative to static analysis.
Simplifying transformations of OCL constraints
 Proceedings, Model Driven Engineering Languages and Systems (MoDELS), Montego
, 2005
"... Abstract. With the advent of Model Driven Architecture, OCL constraints are no longer necessarily written by humans. They can be part of models that emerge from a chain of transformations. They might be the result of instantiating templates, of combining prefabricated parts, or of more general compu ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Abstract. With the advent of Model Driven Architecture, OCL constraints are no longer necessarily written by humans. They can be part of models that emerge from a chain of transformations. They might be the result of instantiating templates, of combining prefabricated parts, or of more general computation. Such generated specifications will often contain redundancies that reduce their readability. In this paper, we explore the possibilities of transforming OCL formulae to a simpler form through the repeated application of simple rules. We discuss the different kinds of rules that are needed, and we describe a prototypical implementation of the approach. 1
Verification of safety properties in the presence of transactions
 POST CONF. PROC. OF CASSIS: CONSTRUCTION AND ANALYSIS OF SAFE, SECURE AND INTEROPERABLE SMART DEVICES, MARSEILLE, VOLUME 3362 OF LNCS
, 2005
"... ..."
(Show Context)
Hybrid state machines with timed synchronization for multirobot system specification
 PROCEEDINGS OF WORKSHOP ON INTELLIGENT ROBOTICS (IROBOT’2005
, 2005
"... In multirobot systems such as in the RoboCup, the need for precise modeling or specification of agent behaviors arises due to the high complexity of the robot agent interactions and the dynamics of the environment. Since the behavior of agents usually can be understood as driven by external event ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
In multirobot systems such as in the RoboCup, the need for precise modeling or specification of agent behaviors arises due to the high complexity of the robot agent interactions and the dynamics of the environment. Since the behavior of agents usually can be understood as driven by external events and internal states, it is obvious to model multiagent systems by state transition diagrams. The corresponding formalisms come equipped with a formal semantics which is advantageous. In this paper, a combination of UML statecharts and hybrid automata is proposed, allowing formal system specification on different levels on abstraction on the one hand, and expressing realtime system behavior with continuous variables on the other hand. One important aspect of multirobot systems is the need of coordination and hence synchronization of behavior. For both, statecharts and hybrid automata, usually it is assumed that synchronization takes zero time. This is sometimes unrealistic. Therefore, a new notation and implementation of synchronization is proposed here, which overcomes this problem. The proposed method is illustrated with a case study from the RoboCup domain. An example from an industrial application is also shown.
Formal Development of Safe and Secure Java Card Applets
, 2002
"... This thesis is concerned with different aspects of JAVA CARD application development and use of formal methods in the JAVA CARD world. JAVA CARD is a technology that provides means to program smart (chip) cards with (a subset of) the JAVA language. The use of formal methods in the JAVA CARD context ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
This thesis is concerned with different aspects of JAVA CARD application development and use of formal methods in the JAVA CARD world. JAVA CARD is a technology that provides means to program smart (chip) cards with (a subset of) the JAVA language. The use of formal methods in the JAVA CARD context is highly justified due to the criticality of JAVA CARD applications. First of all, JAVA CARD applications are usually security critical (e.g., authentication, electronic cash), second, they are cost critical (i.e. they are distributed in large amounts making updates quite difficult) and finally, they can also be legally critical (e.g., when the digital signature law is considered). Thus the robustness and correctness of JAVA CARD applications should be enforced by the best means possible, i.e. by the use of formal verification techniques. At the same time JAVA CARD seems to be a good target for formal verification—due to the relative simplicity of JAVA CARD applications (as compared to full JAVA), formal verification becomes a feasible and manageable task. In this thesis, we touch upon different
Formal Specification of Securityrelevant Properties of User Interfaces
, 2004
"... When sensitive information is exchanged with the user of a computer system, the security of the system's user interface must be considered. In this paper, we show how security relevant properties of a user interface can be modelled and specified using the Object Constraint Language (OCL). ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
When sensitive information is exchanged with the user of a computer system, the security of the system's user interface must be considered. In this paper, we show how security relevant properties of a user interface can be modelled and specified using the Object Constraint Language (OCL).
Probability Propagation in Petri Nets
, 2005
"... A class of high level Petri nets, called ”probability propagation nets”, is introduced which is particularly useful for modelling probability and evidence propagation. It is demonstrated how propagation of probabilistic Horn abduction and Bayesian networks can be represented and structured by these ..."
Abstract
 Add to MetaCart
A class of high level Petri nets, called ”probability propagation nets”, is introduced which is particularly useful for modelling probability and evidence propagation. It is demonstrated how propagation of probabilistic Horn abduction and Bayesian networks can be represented and structured by these nets. Their simplest form is a probabilistic extension of place/transition nets for modelling logical formulae and deductions. As a consequence, the main means for structuring are transition invariants that can easily be calculated for all ”probability propagation nets” on a place/transition net level.
Workshop Chairs
"... Representing and reasoning with ontologies is the core technology for the Semantic Web, and is growing in importance in many other areas of Computer Science where structured and hierarchically organized knowledge is of importance. While the need for ontological knowledge representation formalisms fo ..."
Abstract
 Add to MetaCart
Representing and reasoning with ontologies is the core technology for the Semantic Web, and is growing in importance in many other areas of Computer Science where structured and hierarchically organized knowledge is of importance. While the need for ontological knowledge representation formalisms for practical applications is abundant, it is apparent that only conceptually and mathematically sound frameworks can provide the means for a significant technological advance in this area. Indeed, formal and foundational aspects of ontologies are being studied in many application domains in order to serve practical needs. It lies in the nature of such fundamental research that a critical mass of different formal perspectives can generate a crossfertilization of ideas and applications. We believe that a significant advance in understanding and establishing sound formal foundations for applied ontology research can this way be made. This workshop was set up to bring together researchers working on foundational aspects of ontologies in different application areas, in order to stimulate an exchange of ideas and methods between the subcommunities.
Background
"... The interactive theorem prover developed in the KeY project, which implements a sequent calculus for JavaCard Dynamic Logic (JavaCardDL) is based on taclets. Taclets are lightweight tactics with easy to master syntax and semantics. Adding new taclets to the calculus is quite simple, but poses correc ..."
Abstract
 Add to MetaCart
(Show Context)
The interactive theorem prover developed in the KeY project, which implements a sequent calculus for JavaCard Dynamic Logic (JavaCardDL) is based on taclets. Taclets are lightweight tactics with easy to master syntax and semantics. Adding new taclets to the calculus is quite simple, but poses correctness problems. We present an approach how derived (nonaxiomatic) taclets for JavaCardDL can be proven sound in JavaCardDL itself. Together with proof management facilities, our concept allows the safe introduction of new derived taclets while preserving the soundness of the calculus.