Current research on verifying security properties of communication protocols has focused on proving integrity and confidentiality using models that include a strong Man-in-the-Middle (MitM) threat. By contrast, protec...
详细信息
ISBN:
(纸本)9783540688624
Current research on verifying security properties of communication protocols has focused on proving integrity and confidentiality using models that include a strong Man-in-the-Middle (MitM) threat. By contrast, protection measures against Denial-of-Service (DoS) must assume a weaker model in which an adversary has only limited ability to interfere with network communications. In this paper we demonstrate a modular reasoning framework in which a protocol P that satisfies certain security properties can be assured to retain these properties after it is "wrapped" in a protocol W[P] that adds DoS protection. this modular wrapping is based on the "onion skin" model of actor reflection. In particular, we show how a common DoS protection mechanism based on cookies can be applied to a protocol while provably preserving safety properties (including confidentiality and integrity) that it was shown to have in a MitM threat model.
Termination analysis has received considerable attention, traditionally in the context of declarative programming, and recently also for imperative languages. In existing approaches, termination is performed on source...
详细信息
ISBN:
(纸本)9783540688624
Termination analysis has received considerable attention, traditionally in the context of declarative programming, and recently also for imperative languages. In existing approaches, termination is performed on source programs. However, there are many situations, including mobile code, where only the compiled code is available. In this work we present an automatic termination analysis for sequential Java Bytecode programs. Such analysis presents all of the challenges of analyzing a low-level language as well as those introduced by object-oriented languages. Interestingly, given a bytecode program, we produce a constraint logic program, CLP, whose termination entails termination of the bytecode program. this allows applying the large body of work in termination of CLP programs to termination of Java bytecode. A prototype analyzer is described and initial experimentation is reported.
the distributed information systems we use every day are becoming more complex and interconnected. Can we trust them with our information? Currently there is no good way to check that distributed software uses informa...
详细信息
the proceedings contain 17 papers. the special focus in this conference is on Mobile and wireless networking, QoS, Ad-Hoc (I), Security, Ad-Hoc (II), Wireless LAN, Cross-layer desing, Wireless sensor networks (I), Phy...
ISBN:
(纸本)3540688625
the proceedings contain 17 papers. the special focus in this conference is on Mobile and wireless networking, QoS, Ad-Hoc (I), Security, Ad-Hoc (II), Wireless LAN, Cross-layer desing, Wireless sensor networks (I), Physical layer, Wireless sensor networks (II), and Mobile and wireless applications. the topics include: Mobility protocols for handoff management in heterogeneous networks;supporting group communication in WCDMA networks;scheme for improving transmission performance of realtime traffic in handover between HMIPv6 intermap domains;donorlist: a new distributed channel allocation scheme for cellular networks;QoS-Aware video communications over TDMA/TDD wireless networks;channel state-aware joint dynamic cell coordination scheme using adaptive modulation and variable reuse factor in OFDMA downlink;comparative analysis among different monitoring functions in a bandwidth renegotiation scheme for packet switched cellular networks;load balancing approach for wireless IEEE 802.11 QoS enhancement;stable and energy efficient clustering of wireless ad hoc networks with LIDAR algorithm;DNS-based service discovery in ad hoc networks: evaluation and improvements;a hop-by-hop multipath routing protocol using residual bandwidth for wireless mesh networks;lowest weight: reactive clustering algorithm for adhoc networks;distributed self-policing architecture for fostering node cooperation in wireless mesh networks;RFID systems: a survey on security threats and proposed solutions;TMSI allocation mechanism using a secure VLR authorization in the GSM system;on the anomaly intrusion-detection in mobile ad hoc network environments;locally-constructed trees for adhoc routing;and overlay small group multicast mechanism for MANET.
the proceedings contain 19 papers. the topics discussed include: security issues in service composition;separating distribution from coordination and computation as architectural dimensions, bounded analysis and decom...
详细信息
ISBN:
(纸本)354034893X
the proceedings contain 19 papers. the topics discussed include: security issues in service composition;separating distribution from coordination and computation as architectural dimensions, bounded analysis and decomposition for behavioural descriptions of components, synchronizing behavioural mismatch in software composition;static safety for an actor dedicated process calculus by abstract interpretation;temporal superimposition of aspects for dynamic software architecture;modeling long-running transactions with communicating hierarchical timed automata;transformation laws for UML-RT;underspecification, inherent nondeterminism and probability in sequence diagrams;generating instance models from meta models;defining object-oriented execution semantics using graph transformations;type-safe runtime class upgrades in Creol;and abstract interface behavior of object-oriented languages with monitors.
this paper gives an overview of the KeY approach and highlights the main features of the KeY system. KeY is an approach (and a system) for the deductive verification of object-oriented software. It aims for integratin...
详细信息
ISBN:
(纸本)9783540729198
this paper gives an overview of the KeY approach and highlights the main features of the KeY system. KeY is an approach (and a system) for the deductive verification of object-oriented software. It aims for integrating design, implementation, formal specification and formal verification as seamlessly as possible. the intention is to provide a platform that allows close collaboration of conventional and formal software development methods.
Behavioral semantics abstracts from implementation details and allows to describe the behavior of software components in a representation-independent way. In this paper, we develop a formal behavioral semantics for cl...
详细信息
ISBN:
(纸本)9783540729198
Behavioral semantics abstracts from implementation details and allows to describe the behavior of software components in a representation-independent way. In this paper, we develop a formal behavioral semantics for class-basedobject-oriented languages with aliasing, subclassing, and dynamic dispatch. the code of an object-oriented component consists of a class and the classes used by it. A component instance is realized by a dynamically evolving set of objects with a clear boundary to the environment. the behavioral semantics is expressed in terms of the messages crossing the boundary. It is defined as an abstraction of an operational semantics based on an ownership-structured heap. We show how the semantics can be used to define substitutability in a program independent way.
Software adaptation aims at generating software pieces called adaptors to compensate interface and behavioural mismatch between components or services. this is crucial to foster reuse. So far, adaptation techniques ha...
详细信息
ISBN:
(纸本)9783540729198
Software adaptation aims at generating software pieces called adaptors to compensate interface and behavioural mismatch between components or services. this is crucial to foster reuse. So far, adaptation techniques have proceeded by computing global adaptors for closed systems made up of a fixed set of components. this is not satisfactory when the systems may evolve, with components entering or leaving it at any time, e.g., for pervasive computing. To enable adaptation on such systems, we propose tool-equipped adaptation techniques for the computation of opensystems adaptors. Our proposal also support incremental adaptation to avoid the computation of global adaptors.
In this paper we present a formalization of Abadi9;s and Cardelli9;s theory of objects in the interactive theorem prover Isabelle/ HOL. Our motivation is to build a mechanized HOL-framework for the analysis of a...
详细信息
ISBN:
(纸本)9783540729198
In this paper we present a formalization of Abadi's and Cardelli's theory of objects in the interactive theorem prover Isabelle/ HOL. Our motivation is to build a mechanized HOL-framework for the analysis of a functional calculus for distributedobjects. In particular, we present (a) a formal model of objects and its operational semantics based on de Bruijn indices (b) a parallel reduction relation for objects (c) the proof of confluence for the theory of objects reusing Nipkow's HOL-framework for the lambda calculus. We expect this framework to be highly reusable and allow further development and mechanized proofs of various aspects of objecttheory, e.g., distribution, aspect orientation, typing.
Refactoring is a method for improving the structure of programs/specifications as to enhance readability, modularity and reusability. Refactorings are required to be behaviour-preserving in that - to an external obser...
详细信息
ISBN:
(纸本)9783540729198
Refactoring is a method for improving the structure of programs/specifications as to enhance readability, modularity and reusability. Refactorings are required to be behaviour-preserving in that - to an external observer - no difference between the program before and after refactoring is visible. In this paper, we develop refactorings for an object-oriented specification formalism combining a state-based language (object-Z) with a process algebra (CSP). In contrast to OO-programming languages, refactorings moving methods or attributes up and down the class hierarchy, in addition, need to change CSP processes. We formally prove behaviour preservation with respect to the failures-divergences model of CSP.
暂无评论