Scheduled System Maintenance
IEEE Xplore is currently undergoing scheduled maintenance.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

2017 International Symposium on Theoretical Aspects of Software Engineering (TASE)

13-15 Sept. 2017

Filter Results

Displaying Results 1 - 25 of 26
  • [Title page]

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

    Publication Year: 2017, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (179 KB)
    Freely Available from IEEE
  • Technical sponsor

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

    Publication Year: 2017, Page(s):1 - 2
    Request permission for commercial reuse | PDF file iconPDF (52 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 2017, Page(s):1 - 2
    Request permission for commercial reuse | PDF file iconPDF (55 KB)
    Freely Available from IEEE
  • Organization

    Publication Year: 2017, Page(s):1 - 2
    Request permission for commercial reuse | PDF file iconPDF (33 KB)
    Freely Available from IEEE
  • Additional reviewers

    Publication Year: 2017, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (30 KB)
    Freely Available from IEEE
  • Formal methods for software testing (invited paper)

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

    This extended abstract takes advantage of a theory of software testing based on formal specifications to point out the benefits and limits of the use of formal methods to this end. A notion of exhaustive test set is defined according to the semantics of the formal notation, the considered conformance relation, and some testability hypotheses on the system under test. This gives a framework for the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SCADE 6: A formal language for embedded critical software development (invited paper)

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

    SCADE is a high-level language and environment for developing safety-critical embedded control software. It has been used for more than twenty years in various application domains like avionics, nuclear plants, transportation, and automotive. SCADE was founded on the synchronous data-flow language Lustre invented by Caspi and Halbwachs. In the early years, it was mainly seen as a graphical notatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conditional transition systems with upgrades

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

    We introduce a variant of transition systems, where activation of transitions depends on conditions of the environment and upgrades during runtime potentially create additional transitions. Using a cornerstone result in lattice theory, we show that such transition systems can be modelled in two ways: as conditional transition systems (CTS) with a partial order on conditions, or as lattice transiti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bisimulations for probabilistic linear lambda calculi

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

    We investigate a notion of probabilistic program equivalence under linear contexts. We show that both a statebased and a distribution-based bisimilarity are sound coinductive proof techniques for reasoning about higher-order probabilistic programs, but only the distribution-based one is complete for linear contextual equivalence. The completeness proof is novel and directly constructs linear conte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing behavioural distance for fuzzy transition systems

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

    The behavioural distance is a more robust way of formalising behavioural similarity between states than bisimulations. The smaller the distance, the more alike the states are. It is helpful for quantitative verifications of concurrent systems. The main contribution of this paper is an effective procedure for computing behavioural distance introduced by Cao et al. (IEEE Transactions on Fuzzy System... View full abstract»

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

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

    Backbone is the common part of each solution in a given propositional formula, which is a key to improving the performance of SAT solving and SAT-based applications, such as model checking and program analysis. In this paper, we propose an optimized approach that combines implication-driven (IDF), conflict-driven (CDF), and unique-driven (UDF) heuristics to improve backbone computing. IDF uses the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An integrated framework for verifying multiple care pathways

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

    Common chronic conditions are routinely treated following standardised procedures known as clinical pathways. For patients suffering from two or more chronic conditions, referred to as multimorbidities, several pathways have to be applied simultaneously. However, since pathways rarely consider the presence of comorbidities, applying several pathways may lead to potentially harmful (medication) con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Assembly program verification for multiprocessors with relaxed memory model using SMT solver

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

    A relaxed memory model allows reordering of memory accesses, which can violate program correctness in multiprocessors. This paper presents an approach to verifying a list of assembly programs under a relaxed memory model. Assembly programs are considered for abstractions, which capture essential information that affects the correctness. For program verification, SMT solvers are adopted for finding... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal verification of user-level real-time property patterns

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

    To ease the expression of real-time requirements, Dwyer, and then Konrad, studied a large collection of existing systems in order to identify a set of real-time property patterns covering most of the useful use cases. The goal was to provide a set of reusable patterns that system designers can instantiate to express requirements instead of using complex temporal logic formulas. A limitation of thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time-sensitive information flow control in timed event-B

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

    Protecting confidential data in today's computing environments is an important problem. Information flow control can help to avoid information leakage and violations introduced by executing the software applications. In software development cycle, it is important to handle security related issues from the beginning specifications at the level of abstract. Mu [1] investigated the problem of preserv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two under-approximation techniques for 3-modal abstraction coverage of event systems: Joint effort?

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

    Model-based testing of event systems can take advantage of considering abstractions rather than explicit models, for controlling their size. A test is then a connected and reachable event sequence. This paper reports on experiments made when adapting for event systems two known under-approximation techniques of predicate tri-modal (may, must+, must-) abstractions. We first instantiate all the abst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic fine-grained locking generation for shared data structures

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

    Correct mutual-exclusion is one of the key challenges in concurrent programming. Although the fine-grained locking schema can be more efficient compared with the coarse-grained techniques, it is tough to use, as well as error-prone. Here we present a static approach, based on program analysis, to automatically add fine-grained locking primitives to data structures implemented as classes. For tree-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal specification of security guidelines for program certification

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

    Secure software can be obtained out of two distinct processes: security by design, and security by certification. The former approach has been quite extensively formalized as it builds upon models, which are verified to ensure security properties are attained and from which software is then derived manually or automatically. In contrast, the latter approach has always been quite informal in both s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A safety and liveness theory for total reversibility

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

    We study the theory of safety and liveness in a reversible calculus where reductions are totally ordered and rollbacks lead systems to past states. Liveness and safety in this setting naturally correspond to the should-testing and inverse may-testing preorders, respectively. In reversible languages, however, the natural models of these preorders would need to be based on both forward and backward ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal development process of safety-critical embedded human machine interface systems

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

    This paper presents a formal development process for safety-critical embedded Human-Machine Interface (HMI) systems. This formal approach is centered on the LIDL formal language and the S3 verification toolset. It is aimed at blurring the boundaries between modeling, design, verification and implementation for the development of HMI. From textual requirements to software, the development process i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A bounded multi-dimensional modal logic for autonomous cars based on local traffic and estimation

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

    The decision-making module on an autonomous car is usually a periodic program. In every cycle, the program makes a decision such as acceleration, brake, initiating a lane change process or a turn process based on the current traffic information gathered from car sensors. In urban traffic with mixed type of vehicles, the real-time performance requirement is critical for the decision-making program ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the semantics of temporal specifications of component-behavior for dynamic architectures

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

    In component-based design, temporal logic is a means to specify the temporal behavior of components. If these components are deployed to a dynamic architecture, they can be activated and deactivated over time. Thus, the traditional semantics of temporal specifications of component-behavior does no longer reflect the actual behavior of the components within such dynamic architectures. To address th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and reasoning about wireless networks: A graph-based calculus approach

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

    We propose a graph-based process calculus for modeling and reasoning about wireless networks with local broadcasts. Graphs are used at syntactical level to describe the topological structures of networks. This calculus is equipped with a reduction semantics and a labelled transition semantics. The former is used to define weak barbed congruence. The latter is used to define a parameterized weak bi... View full abstract»

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