By Topic

Engineering of Complex Computer Systems (ICECCS), 2013 18th International Conference on

Date 17-19 July 2013

Filter Results

Displaying Results 1 - 25 of 49
  • [Front cover]

    Publication Year: 2013, Page(s): C4
    Request permission for commercial reuse | PDF file iconPDF (848 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2013, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (16 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2013, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (53 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2013, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (123 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2013, Page(s):v - viii
    Request permission for commercial reuse | PDF file iconPDF (131 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 2013, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (90 KB) | HTML iconHTML
    Freely Available from IEEE
  • Committees

    Publication Year: 2013, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (103 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2013, Page(s):xi - xii
    Request permission for commercial reuse | PDF file iconPDF (107 KB)
    Freely Available from IEEE
  • Expressiveness of Notations for Reasoning about Concurrency

    Publication Year: 2013, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (85 KB) | HTML iconHTML

    It might appear that having highly expressive notations is an advantage in writing specifications and subsequently reasoning about programs. Even for sequential programs, this is not always true: simple type systems that are statically decidable or fixed formats of specifications that yield intuitive proof obligations both indicate that constrained expressiveness can increase tractability. The aim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid Relation Calculus

    Publication Year: 2013, Page(s): 2
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (71 KB)

    Summary form only given. Hybrid systems are composed by continuous physical component and discrete control component where the system state evolves over time according to interacting law of discrete and continuous dynamics. Combinations of computation and control can lead to very complicated system designs We treat more explicit hybrid models by providing a hybrid relation calculus, where both clo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Goal Model Elaboration for Software Evolution

    Publication Year: 2013, Page(s): 3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (81 KB) | HTML iconHTML

    Summary form only given. Software evolution is an essential activity that adapts existing software to changes in requirements. It has played a central role in the overall software lifecycle in recent years. It is generally acknowledged that the software employed in real-world environments must continuously evolve and adapt. Many studies, on the other hand, have suggested that software evolution co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and Verification of Component-Based Systems with Data Passing Using BIP

    Publication Year: 2013, Page(s):4 - 13
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (601 KB) | HTML iconHTML

    Large-scale systems are often modeled and verified in a component-based way. BIP (Behavior, Interaction, Priority) is a flexible component-based framework which supports hierarchical design of heterogeneous systems. BIP components interact via connectors in which data can be passed among multiple components. It also support the modeling of time. Due to its expressiveness and flexibility, many real... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and Verifying Real-Time Properties of Reactive Systems

    Publication Year: 2013, Page(s):14 - 23
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (578 KB) | HTML iconHTML

    SPACE is a model-driven engineering technique for reactive distributed systems. It enables to develop system models from reusable building blocks, formal analysis by model checking as well as automated transformation to executable code. In this paper, we describe an extension of the SPACE formalism which allows to model and verify also real-time behavior. In particular, one specifies real-time con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Knowledge-Based Verification of Service Compositions -- An SMT Approach

    Publication Year: 2013, Page(s):24 - 32
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (211 KB) | HTML iconHTML

    In the Semantic (Web) Services area, services are considered black boxes with a semantic description of their interfaces as to allow for precise service selection and configuration. The semantic description is usually grounded on domain-specific concepts as modeled in ontologies. This accounts to types used in service signatures, but also to predicates occurring in preconditions and effects of ser... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CosyVerif: An Open Source Extensible Verification Environment

    Publication Year: 2013, Page(s):33 - 36
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (378 KB) | HTML iconHTML

    CosyVerif aims at gathering within a common framework various existing tools for specification and verification. It has been designed in order to 1) support different formalisms with the ability to easily create new ones, 2) provide a graphical user interface for every formalism, 3) include verification tools called via the graphical interface or via an API as a Web service, and 4) offer the possi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measurements for Adaptation Level and Efficiency of Adaptive Software Systems

    Publication Year: 2013, Page(s):37 - 45
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (254 KB) | HTML iconHTML

    It is a great challenge to evaluate self-adaptive software rigorously. This paper first discusses the key aspects of adaptation of software and points out that the adaptation level of a software system is determined by how well the system satisfies the user's expectations through adjusting its behavior or configuration to tackle the changes in the environment. Accordingly, the paper puts forward a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network Performance Evaluation for Distributed Embedded Systems Using Feature Models

    Publication Year: 2013, Page(s):46 - 55
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (297 KB) | HTML iconHTML

    In this paper, we focus on networked, embedded systems which may contain numerous electronic control units, connected by multiple network busses. Furthermore, such embedded systems support many runtime configurations. The main problem is to determine the network resource needs of all variations permitted at runtime, i.e. to calculate the worst case resource needs. We describe the runtime variabili... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Model-Driven Approach for Evaluating System of Systems

    Publication Year: 2013, Page(s):56 - 64
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (762 KB) | HTML iconHTML

    To reduce the cost and risk of the development of system of systems (SoS) by pre-evaluation before the SoS is built, a model-driven approach is proposed to evaluate the SoS based on its architecture, especially focused on measures of performance and effectiveness. In order to implement the pre-evaluation, the system architecture needs to be transformed to the simulation model of the system under t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Adequate Logic for Heterogeneous Systems

    Publication Year: 2013, Page(s):65 - 74
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (299 KB) | HTML iconHTML

    We coalgebraically define a unified semantics for systems with an emphasis on the notion of time. Such a semantics intends to formalize system that underly system engineering (i.e. the discipline focusing on the integration mastery of large industrial systems).Moreover, we give a formal meaning to another important aspect of systems engineering: system requirements, constraining the expected prope... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Refinement Calculus for Promela

    Publication Year: 2013, Page(s):75 - 84
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB) | HTML iconHTML

    The use of formal methods for developing software is increasing. However in many cases only a model of the system is validated against a set of specifications. The actual implementation may thus not correspond to the formal model. One approach to this problem is to directly verify the actual implementation. Another solution is to provide a refinement scheme for the model. In this paper we present ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reusing Search Tree for Incremental SAT Solving of Temporal Induction

    Publication Year: 2013, Page(s):85 - 92
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (241 KB) | HTML iconHTML

    Temporal induction is a SAT-based model checking technique. We prove that the SAT instances generated by its induction rule can be reduced to the so called Incremental CNFs. A new DPLL procedure is customized for Incremental CNFs, so that the intermediate results in solving previous instances, including the learnt clauses and the search tree, can be reused in solving the next instance. To the best... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal Modelling and Analysis of AODV

    Publication Year: 2013, Page(s):93 - 100
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (185 KB) | HTML iconHTML

    Wireless systems have a wide range of applications recently. To explore complex features of such systems, formalisms are proposed to specify and reason about them. This paper presents a case study of routing protocol in wireless networks. We formalize the route discovery process of AODV routing protocol using Object-Z. Network topology and local variables of nodes are defined by relations and func... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatio-temporal Properties Analysis for Cyber-physical Systems

    Publication Year: 2013, Page(s):101 - 110
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB) | HTML iconHTML

    Cyber-Physical Systems (CPSs) integrate computing, communication and control processes. Close interactions between the cyber and physical worlds occur in time and space frequently. Therefore, both temporal and spatial information should be taken into consideration when specifying properties of CPS systems for verification. However, how to formulate properties specifying spatial together with tempo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Bounded Fairness to Specify and Verify Ordered Asynchronous Multi-agent Systems

    Publication Year: 2013, Page(s):111 - 120
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    Asynchronous multi-agent systems (AMAS) are multi-agent systems with asynchronous updates and communications. They are often designed from the point of view of local computations and the interactions of autonomous agents. However, often some functionality of the system is proposed from the global point of view. It is not always possible to verify such global functionality under total, random, asyn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic Analysis of TiMo Systems in PAT

    Publication Year: 2013, Page(s):121 - 124
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (929 KB) | HTML iconHTML

    TiMo is a process calculus for mobile systems where timers could be to used to control process mobility and interaction. Despite its syntactic simplicity, TiMo is able to describe complex systems. Interesting properties of such systems refers to process migration, time constraints, bounded liveness and optimal reachability. In this work we describe a tool, called TiMo@PAT, developed by using Proce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.