2013 International Symposium on Theoretical Aspects of Software Engineering

1-3 July 2013

Filter Results

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

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

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

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

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

    Publication Year: 2013, Page(s):v - vii
    Request permission for commercial reuse | PDF file iconPDF (132 KB)
    Freely Available from IEEE
  • Welcome Message from the Program Committee Chairs

    Publication Year: 2013, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (77 KB) | HTML iconHTML
    Freely Available from IEEE
  • Committee lists

    Publication Year: 2013, Page(s):ix - xi
    Request permission for commercial reuse | PDF file iconPDF (101 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2013, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (56 KB)
    Freely Available from IEEE
  • Engineering Multi-view Models for Model-Driven Engineering

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

    The effectiveness of model-driven engineering relies on our ability to build high quality models. This task is intrinsically difficult. We need to produce sufficiently complete, adequate, consistent, and well-structured models from incomplete, imprecise, and sparse material originating from multiple, often conflicting sources. The systems we need to consider generally comprises software components... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Planning in Real-Time Domains with Timed CTL Goals via Symbolic Model Checking

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

    Current methods for planning in real-time environments only consider planning goals with a restricted expressiveness, even those using the temporal logic Timed CTL (TCTL). These approaches support TCTL subsets expressing rather simple reachability goals and safety properties, but do not allow the arbitrary nesting and conjunction of TCTL formulas. However, this is a serious drawback in many practi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Process Rewrite Systems for Software Model Checking

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

    We consider the verification problem of multithreaded recursive programs. We use Process Rewrite Systems (PRS) to model such programs. This allows the use of all the existing results for the analysis of PRS to analyse multithreaded recursive programs. We first give a fully automatic translation from parallel recursive programs to PRS. As far as we know, this is the first time that a formal transla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing the SAT Decision Ordering of Bounded Model Checking by Structural Information

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

    This paper considers bounded model checking for extended labeled transition systems. Bounded model checking relies on a SAT solver to prove (or disprove) the existence of a counterexample with a bounded length. During the translation of a BMC problem to a SAT problem, much useful information is lost. This paper proposes an algorithm to analyze the transition system model, and then utilize the stru... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Timing Verification Framework for AUTOSAR OS Component Development Based on Real-Time Maude

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

    The AUTOSAR (AUTomotive Open System ARchitecture) is an open standard in automotive industry, aiming at unifying the methodology of the automotive software development. It is drawing increasing attention because of its great concern about the safety of automotive electronics. The safety of automotive electronics greatly depends on the Operating System (OS) components, which fully implement the fun... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and Verification of AUTOSAR OS and EMS Application

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

    AUTOSAR, derived from OSEK/VDX, is the most popular industrial standard in the automotive electric development. It is challenging to manually verify or validate the correctness and safety of AUTOSAR Operating System (OS) as well as mission-critical or real-time applications built on it. In this paper, we adopt timed CSP to describe and reason about the Schedule Table, a new task scheduling mechani... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal Analysis of AODV Using Rely-Guarantee

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

    Mobile Ad-hoc Networks (MANETs) are increasingly deployed in infrastructureless scenarios. Routing protocol is a crucial solution for MANETs to establish network connections. This paper presents a formal description of the AODV routing protocol and analyzes its properties using relyguarantee method. In our approach the network is specified as a shared variable concurrent program, where communicati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic Framework for Synchronous Language Semantics

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

    In this article, we study several relevant algebraic frameworks to define synchronous language semantics. Synchronous languages are quite dedicated to design critical embedded applications. Thus, verification and compilation is challenging and should rely on mathematical semantics. We study multi-valued algebras as foundation for semantics definition and we show that a 4-valued algebra with a bila... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards Conformance Testing of Choreography Based on Scenario

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

    Web service choreography specifies the interaction among multiple participant, aiming to achieve common business goals. An issue is to check for the conformance of the implementation with reference to the choreography specification. To achieve that, we seek to develop software tools and a methodology to enable conformance testing of choreography. In this paper, we present our first step in that di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aspect-Oriented Semantic Framework for Executable Models

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

    Aspect-Oriented Modeling (AOM) has gained a lot of attention from researchers. It emerged as an appropriate paradigm to improve the modularization of crosscutting concerns at the software modeling phase. On the other hand, with the rise of Model-Driven Development, Executable UML (xUML) plays a central role since it allows modelers to specify detailed specifications that can be automatically trans... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designs with Angelic Nondeterminism

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

    Hoare and He's Unifying Theories of Programming (UTP) are a predicative relational framework for the definition and combination of refinement languages for a variety of programming paradigms. Previous work has defined a theory for angelic nondeterminism in the UTP; this is basically an encoding of binary multirelations in a predicative model. In the UTP a theory of designs (pre and postcondition p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • When Even the Interface Evolves...

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

    This paper extends the authors' previous work on a formal approach to the specification of reconfigurable systems, introduced in [7], in which configurations are taken as local states in a suitable transition structure. The novelty is the explicit consideration that not only the realisation of a service may change from a configuration to another, but also the set of services provided and even thei... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model Repair for Markov Decision Processes

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

    Markov decision processes (MDPs) are often used for modelling distributed systems with probabilistic failure or randomisation. We consider the problem of model repair for MDPs defined as follows: if the MDP fails to satisfy a property, we aim to find new values for the transition probabilities so that the property is guaranteed to hold, while at the same time the cost of repair is minimised. Becau... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aspect Orientation Based Test Case Selection Strategy for Service Composition

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

    Software testing is an important part of software maintenance, but it can also be very expensive. To reduce this expense, software testers may select part of their test cases so that those that are more important are run earlier in the testing process. However, the methods that can be used to select test cases for service composition and its analysis are still lacking at present. This paper propos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Programming Language Approach to Fault Tolerance for Fork-Join Parallelism

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

    When running big parallel computations on thousands of processors, the probability that an individual processor will fail during the execution cannot be ignored. Computations should be replicated, or else failures should be detected at runtime and failed subcomputations reexecuted. We follow the latter approach and propose a high-level operational semantics that detects computation failures, and a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Denotational Semantics of Spatial-Temporal Consistency Language -- STeC

    Publication Year: 2013, Page(s):113 - 120
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB) | HTML iconHTML

    In order to describe the requirement of spatial and temporal consistency of cyber-physical systems, a specification language called as STeC was proposed by Chen in [1]. In this paper, we focus on the theory of semantics of STeC. After simply restating the syntax and operational semantics, we mainly establish the denotational semantics of STeC. To investigate the reasonability of the denotational s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Operational Approach to Happens-Before Memory Model

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

    Happens-before memory model (HMM) is used as the basis of Java memory model (JMM). Although HMM itself is simple, some complex axioms have to be introduced in JMM to prevent the causality loop, which causes absurd out-of-thin-air reads that may break the type safety and security guarantee of Java. The resulting JMM is complex and difficult to understand. It also has many anti-intuitive behaviors, ... View full abstract»

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