By Topic

Engineering of Computer Based Systems (ECBS), 2012 IEEE 19th International Conference and Workshops on

Date 11-13 April 2012

Filter Results

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

    Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (185 KB)  
    Freely Available from IEEE
  • [Title page i]

    Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (38 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (87 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (120 KB)  
    Freely Available from IEEE
  • Table of contents

    Page(s): v - ix
    Save to Project icon | Request Permissions | PDF file iconPDF (111 KB)  
    Freely Available from IEEE
  • Message from General Chair

    Page(s): x
    Save to Project icon | Request Permissions | PDF file iconPDF (103 KB)  
    Freely Available from IEEE
  • Message from Program Chairs

    Page(s): xi
    Save to Project icon | Request Permissions | PDF file iconPDF (107 KB)  
    Freely Available from IEEE
  • Conference organization

    Page(s): xii
    Save to Project icon | Request Permissions | PDF file iconPDF (106 KB)  
    Freely Available from IEEE
  • Program Committee

    Page(s): xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (110 KB)  
    Freely Available from IEEE
  • Reviewers

    Page(s): xiv
    Save to Project icon | Request Permissions | PDF file iconPDF (86 KB)  
    Freely Available from IEEE
  • Keynote

    Page(s): xv
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (167 KB)  

    Provides an abstract of the keynote presentation and a brief professional biography of the presenter. The complete presentation was not made available for publication as part of the conference proceedings. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity of a Special Deobfuscation Problem

    Page(s): 1 - 4
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (310 KB) |  | HTML iconHTML  

    This paper considers process of obfuscation as adding additional (redundant) entities to the program at intermediate representation that would complicate the understanding of entangled code. The presented mathematical apparatus discusses introductory terms, definitions, and operations and formulates a theorem about NP-completeness of such deobfuscation problem. We show that the problem of determining the significance of the operational logic in the obfuscated routine is reduced to the Boolean satisfiability problem. The limits of applicability of the theorem are mentioned and an approach is offered that can significantly reduce the probability of creating a deobfuscator running in polynomial time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Template Metaprogramming to Enhance Reuse in Visitor-Based Model Interpreters

    Page(s): 5 - 14
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (412 KB) |  | HTML iconHTML  

    This paper discusses an approach called Metapro-grammable Interpreters for Model-driven Engineering (MIME), which integrates C++ meta-programming techniques into model interpreters for domain-specific modeling languages (DSMLs). The goal of MIME is to reduce reinvention of core model interpretation logic across model interpreters that use the Visitor software design pattern. Experience from applying MIME's approach to realistic DSMLs show it overcomes limitations of existing Visitor-based model interpreters by (1) decoupling interpreter-logic from generation-logic and (2) allowing developers to suppress either aspect of the model interpreter, while promoting maximal reuse of code. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated Software Generation and Hardware Coprocessor Synthesis for Data-Adaptable Reconfigurable Systems

    Page(s): 15 - 23
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1042 KB) |  | HTML iconHTML  

    We present an overview of a data-adaptable reconfigurable embedded systems design methodology. The paper presents a novel paradigm for hardware/software code sign and reconfigurable computing driven by data-adaptability. The data-adaptable approach allows designers to directly model the data configurability of the target application, thereby enabling a solution that permits dynamic reconfiguration based on the data profile of the incoming data stream. This approach permits low-power, small form-factor hardware implementations of algorithms that might otherwise consume significant resources, or perhaps exceed the available space of the reconfigurable hardware. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and Verifying the Ariadne Protocol Using CSP

    Page(s): 24 - 32
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (830 KB) |  | HTML iconHTML  

    Mobile Ad Hoc Networks (MANETs) are formed dynamically by mobile nodes without the support of prior stationary infrastructures. In such networks, routing protocols, particularly secure ones are always an essential part. Ariadne, an efficient and well-known on-demand secure protocol of MANETs, mainly concerns about how to prevent a malicious node from compromising the route. In this paper, we apply the method of process algebra Communicating Sequential Processes (CSP) to model and reason about the Ariadne protocol, focusing on the process of its route discovery. In our framework, we consider the communication entities as processes, including the initiator, the intermediate nodes and the target. Moreover, we use PAT, a model checker for CSP, to verify whether the model caters for the specification and the non-trivial secure properties, e.g. existence of fake path. Our verification result naturally demonstrates that the fake routing attacks may be present in the Ariadne protocol. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model Checking Goal-Oriented Requirements for Self-Adaptive Systems

    Page(s): 33 - 42
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1356 KB) |  | HTML iconHTML  

    To deal with the increasing complexity and uncertainty of software systems, novel software engineering models and tools are required to make such systems self-adaptive. As part of ongoing research, we investigate various models, schemes and mechanisms to model and engineer self-adaptation in complex software systems. To this end, we have defined SOTA (State of the Affairs) as a general goal-oriented modeling framework for the analysis and design of self-adaptive systems. In this paper, by transforming the conceptual SOTA model into an operational one, we show how SOTA can be an effective tool to perform an early, goal-level, model checking analysis for adaptive systems. This allows the developers of complex self-adaptive systems to validate the actual correctness of the self-adaptive requirements at an early stage in the software life-cycle. The approach is explored and validated using a case study in the area of e-mobility. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Parameterized Attributes to Improve Testing Capabilities with Domain-Specific Modeling Languages

    Page(s): 43 - 51
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1540 KB) |  | HTML iconHTML  

    Domain-specific modeling languages (DSMLs) show promise in improving model-based testing and experimentation (T&E) capabilities for software systems. This is because its intuitive graphical languages reduce complexities associated with error-prone, tedious, and time-consuming tasks. Despite the benefits of using DSMLs to facilitate model-based T&E, it is hard for testers to capture many variations of similar tests without manually duplicating modeling effort. This paper therefore presents a method called parameterized attributes that is used to capture points-of-variation in models. It also shows how parameterized attributes is realized in an open-source tool named the Generic Modeling Environment (GME) Template Engine. Finally, this paper quantitatively evaluates applying parameterized attributes to T&E of a representative distributed software system. Experience and results so show that parameterized attributes can reduce modeling effort after an initial model (or design) is constructed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Touch-Screen Stimulation for Automated Verification of Touchscreen-Based Devices

    Page(s): 52 - 55
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (415 KB) |  | HTML iconHTML  

    This paper presents an approach to stimulation of the touch-screen as part of the automated system for smart phone and tablet verification. Stimulation is performed in two ways: by touching the screen with the long conductor connected to the ground and by stimulating the screen with orthogonal conductive lines. The conductor is disconnected from the screen electrically, with the use of a transistor. Controlling the on/off state of the transistor controls whether the conductor touches the screen or not. The capacitance of the conductor is enough to change the structure of the electric field such that the touch-screen controller senses the touch when the conductor is connected to the screen, which happens when the transistor is turned on. The system was tested using different touch areas. It showed a clear increase in touch frequency detected by the controller when the transistor is turned on. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simultaneous Functionality Verification System of Multiple Set-Top Boxes

    Page(s): 56 - 59
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1178 KB) |  | HTML iconHTML  

    Set-Top Box device functionalities have been advancing fast during the last decade. This has been mainly triggered by appearance of new multimedia services and applications. Given the high complexity of the STB and large amount of services to be supported, the STB functional verification has become highly challenging task, from both the testing time and testing reliability perspective. High competitiveness and the need to reduce time-to-market make efficient automatic STB testing absolutely necessary. Although automatic testing is considered superior to the manual testing, in general it is difficult to design it for different real case scenarios, and especially in case the input multimedia signal is unknown (live video stream). Another problem is that optimally multiple STB should be tested simultaneously in order to reduce the testing time, in cases when detailed stress testing is required. In order to address these issues, in this paper we propose a new solution and system (with hardware and software modules) for automatic simultaneous functional verification system of multiple Set-Top Boxes based on Black Box Testing (BBT). In the proposed testing system one STB serves as the referent one (for the rest of the STBs under test) with a priory known "faultless" functionality. This enables the STB functional testing with unknown input signal (during live video stream), because the output of the referent STB will serve as the expected output given the same unknown input signal. This is considered as the main contribution of the proposed testing approach along with the acceleration of the STB functional verification process which ensures reduction of time and costs that is considered to be crucial in STB production. The experimental results show high testing accuracy, robustness and efficiency in case of live broadcast video (DVB-S). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic Set-Top Box Menu Navigation Scheme for STB Menu Functional Verification

    Page(s): 60 - 63
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (735 KB) |  | HTML iconHTML  

    An increased complexity of current Set-Top Box (STB) solutions is accompanied by more difficult verification of wide range of supporting functionalities. Due to large number of the STB functionalities the menu of the STB, which is considered as the main tool for the STB control, is of more complex structure. The complexity of the STB menu structure makes both manual and automatic control of the STB more difficult, which is crucial for efficient STB functional verification. This paper proposes a new solution for automated error free navigation through the STB menu for effective functional verification of the STB. The proposed testing solution is based on the existing Black-box testing (BBT) system for testing STB, by specially designed functional drivers. The BBT is customizable, easy to use, cost effective automated solution for system testing of STB. The testing approach for automatic error free navigation through STB menu is based on the constructed software-wise menu structure that enables automatic setting of the STB in a desired STB state, given the extracted string content of the current STB state and the target menu item. Specifically, in proposed scheme the STB menu is automatically navigated from the start to the target state iteratively until the current and the target state are found to be equal. The proposed testing solution provides greater testing efficiency and reliability for the STB functional verification as a result of automatic navigation through the STB menus, which reduces the amount of manual test-case generation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Analytical Review of Process-Centered Software Engineering Environments

    Page(s): 64 - 73
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (687 KB) |  | HTML iconHTML  

    Process-centered Software Engineering Environments, or PSEEs, are intended for the definition, modification, and enactment of software process models, they thus bring software development processes into effect. Even though research efforts in process-centered software engineering abound, PSEE technology has not received the attention that it deserves. In order to create a concise but effective and practically applicable evaluation framework for PSEEs, this paper first presents a survey of PSEEs and highlights the current state of the art of the technology. The PSEEs which have been reviewed herein have been regarded as software systems, and as such, have been characterized in terms of their requirements. After providing a conceptual critique of the scope and nature of conventional PSEEs, a detailed criteria-based evaluation of a select set of several recent PSEEs has been conducted. The evaluation criteria have been derived from PSEE requirements and the results of the critique, and have then been refined and evolved into the final criterion set. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Way towards Efficiency of SCADA Infrastructure

    Page(s): 74 - 81
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1469 KB) |  | HTML iconHTML  

    Traditional SCADA solutions are currently under strong pressure by market, to shift their focus from process control of a limited set of industrial plants, to the control of a whole large-scale system. Usually this whole system is only partially covered by SCADA IO signals, therefore complex simulation model is required not only to give decision support, but also to replace all missing measurements. The whole control system has to be fully integrated, where SCADA infrastructure needs to hold and distribute all data, both SCADA and calculated. It leads to the extreme increase of real-time database, with millions of data points. It is a challenge that traditional SCADA designs, based on shared memory database and competing processes, cannot fulfill in real-time. The paper presents an alternative approach architecture and basic functionality of a SCADA system developed in line with this concept. It implements a SCADA server as a single executable with multiple threads, sharing data points stored in its own local memory. Threads provide parallel execution, while data integrity is achieved through careful data organization/segmentation, thread priorities and the use of thread-safe primitives for accessing data. It easily provides performances required by this type of applications. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Architecture for Safe and Secure Automation System Devices and Maintenance Process

    Page(s): 82 - 89
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (783 KB) |  | HTML iconHTML  

    This paper describes a generic high-level security architecture for safety critical automation system devices and a secure solution for device maintenance. The main focus lies on security measures which can be implemented by the automation device manufacturer. Common threats and attack vectors for automation systems are identified and classified regarding their criticality. Based on those threats appropriate countermeasures are suggested. Benefits such as security and safety synergies of these countermeasures as well as issues regarding their implementation are discussed. The security architecture includes PLC device level measures, communication concepts for the automation software development platform and suggestions for software update mechanisms. The aim of the measures is to shift parts of the security implementation process from the automation system developer to the automation device manufacturer in order to achieve mature and economic security solutions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beyond Mainstream Adoption: From Agile Software Development to Agile Organizational Change

    Page(s): 90 - 97
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (796 KB) |  | HTML iconHTML  

    The agile paradigm is now a mainstream approach to software development, with Scrum emerging as the dominant methodology in the field. The rapid diffusion of the approach is an indicator of its current value to organizations but further gains seem possible. One major step would be the use of the agile approach in all organizational activity. This opportunity has always been part of the Scrum philosophy but few have attempted to put it into practice so far. The purpose of this paper is to consider what is involved, proposing a hierarchical Scrum model to make it suitable for such wider use. The proposal draws on established ideas from both Soft Systems Methodology (SSM) and Deming's Plan-Do-Study-Act (PDSA) cycle. The new model also has the potential to enhance the basic agile development process for software. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Taxonomy of Change Types and Its Application in Software Evolution

    Page(s): 98 - 107
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (525 KB) |  | HTML iconHTML  

    Changes play a central role in software evolution, where the types of changes are as multifarious as their consequences. When changing software, impact analysis and regression testing are required to preserve the quality of the system. However, without a consistent classification of types of change operations, a well-founded impact analysis methodology cannot be developed. Existing works which analyze and apply change types are typically limited to a certain aspect of software, e.g. source code or architecture. They also lack a thorough investigation of change types, which lead to duplicated proposals and the absence of a consistent taxonomy. In this paper, we review the usage of change types for impact analysis and regression testing, and illustrate how both activities are affected by different types of changes. Therefore, we outline how existing work deals with different types and granularities of changes. Our main contribution is a generic, graph-based description of changes which distinguishes between atomic and composite change types. We show how existing change types and classifications can be mapped onto our proposed approach and change taxonomy. Finally, we illustrate how our proposed change types can support real developer activities, such as refactorings, impact analysis, and regression testing. View full abstract»

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