Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

2015 15th International Conference on Application of Concurrency to System Design

21-26 June 2015

Filter Results

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

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

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

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

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

    Publication Year: 2015, Page(s): vii
    Request permission for commercial reuse | PDF file iconPDF (93 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference Organization

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

    Publication Year: 2015, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (97 KB)
    Freely Available from IEEE
  • Additional reviewers

    Publication Year: 2015, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (66 KB)
    Freely Available from IEEE
  • Invited speaker

    Publication Year: 2015, Page(s):xi - xii
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 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.
  • Incremental Inductive Verification of Parameterized Timed Systems

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

    We propose an incremental workflow for the verification of parameterized systems modeled as symmetric networks of timed automata.Starting with a small number of timed automata in the network, a safety property is verified using IC3, a state-of-the-art algorithm based on induction.The result of the verification, an inductive strengthening, is reused proposing a candidate inductive strengthening for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stop It, and Be Stubborn!

    Publication Year: 2015, Page(s):10 - 19
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (229 KB) | HTML iconHTML

    A system is always may-terminating, if and only if from every reachable state, a terminal state is reachable. This publication argues that it is beneficial for both catching non-progress errors and stubborn, ample, and persistent set state space reduction to try to make verification models always may-terminating. An incorrect mutual exclusion algorithm is used as an example. The error does not man... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining Explicit and Symbolic LTL Model Checking Using Generalized Testing Automata

    Publication Year: 2015, Page(s):20 - 29
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (782 KB) | HTML iconHTML

    In automata-theoretic model checking, there are mainly two approaches: explicit and symbolic. In the explicit approach [1], the state-space is constructed explicitly and lazily during exploration (i.e., on-the-fly). The symbolic approach [2] tries to overcome the state-space explosion obstacle by symbolically encoding the state-space in a concise way using decision diagrams. However, this symbolic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • When Do We (Not) Need Complex Assume-Guarantee Rules?

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

    Assume-guarantee (AG) reasoning is a compositional verification method where a verification task involving many processes is broken into multiple verification tasks involving fewer and/or simpler processes. Unfortunately, AG verification rules, and especially circular rules are often complex and hence hard to reason about. This raises the question whether complex rules are really necessary, especi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unfolding Based Minimal Test Suites for Testing Multithreaded Programs

    Publication Year: 2015, Page(s):40 - 49
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (357 KB) | HTML iconHTML

    This paper focuses on the problem of computing the minimal test suite for a terminating multithreaded program that covers all its executable statements. We have in previous work shown how to use unfoldings to capture the true concurrency semantics of multithreaded programs and to generate test cases for it. In this paper we rely on this earlier work and show how the unfolding can be used to genera... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Building a Symbolic Model Checker from Formal Language Description

    Publication Year: 2015, Page(s):50 - 59
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (443 KB) | HTML iconHTML

    The main limit towards practical model-checking is the combinatorial explosion of the number of states. Among numerous solutions proposed to tackle this problem, Decision Diagrams (DDs) have been proved efficient. They are however low-level data structures: translating a high-level model to them can be cumbersome. Indeed, little work towards their better usability has been undertaken. We propose a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing Preorders for dMTS: Deadlock- and the New Deadlock/Divergence-Testing

    Publication Year: 2015, Page(s):60 - 69
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (390 KB) | HTML iconHTML

    Testing preorders on component specifications ensure that replacing a specification by a refined one does not introduce unwanted behaviour in an overall system. Considering deadlocks as unwanted, the preorder can be characterized by a failure semantics on labelled transition systems (LTS). In previous work, we have generalized this to modal transition systems (MTS) with a new, MTS-specific idea. I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-valued Abstraction Using Lattice Operations

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

    In model checking, abstractions can cause spurious results, which need to be verified in the concrete system to gain conclusive results. Verification based on a multi-valued logic can distinguish between conclusive and inconclusive results, provides increased precision, and allows for encoding additional information into the model, which gives rise to new applications. To ensure a correct abstract... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-interference in Partial Order Models

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

    Non-interference (NI) is a property of systems stating that confidential actions should not cause effects observable by unauthorized users. Several variants of NI have been studied for many types of models, but rarely for true concurrency or unbounded models. This work investigates NI for High-level Message Sequence Charts (HMSC), a scenario language for the description of distributed systems, bas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Task-FIFO Co-scheduling of Streaming Applications on MPSoCs with Predictable Memory Hierarchy

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

    Multi-processor systems-on-chips are widely adopted in implementing modern streaming applications to satisfy the ever increasing computing requirements. Predictable memory hierarchies, which make memory access predictable, can better satisfy the strict timing requirements of streaming applications. However, different levels of the memory hierarchy vary in latency and capacity. Hence, the system pe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Heuristic Algorithm for Deriving Compact Models of Processor Instruction Sets

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

    Finding a compact formal representation of a processor instruction set is important for easier comprehension by the designer, as well as for synthesis of an efficient hardware implementation of the processor's microcontroller. We present a new heuristic algorithm for deriving compact models of processor instruction sets. The algorithm is based on finding similarities between pairs of instructions ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Order Graphs and Cross-Layer Parametric Significance-Driven Modelling

    Publication Year: 2015, Page(s):110 - 119
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (499 KB) | HTML iconHTML

    Traditional hierarchical modelling methods tend to have layers of abstraction corresponding to naturally existing layers of concern in multi-level systems. Although logically and functionally intuitive, this is not always optimal for analysis and design. For instance, parts of a system in the same logical layer may not contribute to the same degree on some metric, e.g. system power consumption. Wh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Preserving Partial Order Runs in Parametric Time Petri Nets

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

    Parameter synthesis for timed systems aims at deriving parameter valuations satisfying a given property. In this paper we target concurrent systems; it is well known that concurrency is a source of state-space explosion, and partial order techniques were defined to cope with this problem. Here we use partial order semantics for parametric time Petri nets as a way to significantly enhance the resul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strongly Generalized Soundness of Time Workflow Nets

    Publication Year: 2015, Page(s):130 - 139
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (322 KB) | HTML iconHTML

    We consider here the time Workflow nets [11], [17] with an arbitrary large number, denoted ω of tokens in their source places and investigate the verification of their soundness. We first revisit the notion of (strong) soundness in the context of permanent and concurrent evolutions of process instances. Then, we show how to verify (strong) ω-soundness of time workflow nets, using a f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Framework for Composition, Verification and Real-Time Performance of Multimedia Interactive Scenarios

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

    Interactive Scores (IS) is a formalism for composing and performing interactive multimedia scenarios. In IS, the composer defines temporal relations (TRs) between temporal objects (TOs) in order to specify the temporal organization of the scenario. During execution, the performer may trigger interaction points to modify the star/stop times of TOs, while the system guarantees that all the TRs are s... View full abstract»

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

    Publication Year: 2015, Page(s): 152
    Request permission for commercial reuse | PDF file iconPDF (59 KB)
    Freely Available from IEEE