By Topic

2010 4th IEEE International Symposium on Theoretical Aspects of Software Engineering

25-27 Aug. 2010

Filter Results

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

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

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

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

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

    Publication Year: 2010, Page(s):v - vii
    Request permission for commercial reuse | PDF file iconPDF (162 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 2010, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (163 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing and Program Committees

    Publication Year: 2010, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (137 KB)
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2010, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (103 KB)
    Freely Available from IEEE
  • Automated Test Case Generation of Self-Managing Policies for NASA Prototype Missions Developed with ASSL

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

    Self-managing policies provide a self-management behavior for autonomic systems developed with ASSL (Autonomic System Specification Language). With ASSL we have successfully developed special autonomic prototypes of both the NASA ANTS (Autonomous Nano-Technology Swarm) concept mission and NASAs Voyager Mission. In these prototypes, we applied ASSL self-managing policies to drive the missions in cr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Art of Developing Autonomic Systems - The ASSL Approach

    Publication Year: 2010, Page(s):9 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (313 KB) | HTML iconHTML

    Autonomic Computing is a rapidly growing IT field that promises a new approach to developing largescale complex computing systems. The AC paradigm aims at handling complexity through self-management by transforming computing systems into autonomic systems. There are many kinds of knowledge that need to be considered for the development of autonomic systems. These are domain knowledge, control know... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Formal Model for Service Choreography with Exception Handling and Finalization

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

    The service choreography gives a global view on the collaboration among a collection of services involving multiple different organizations or independent processes. In this paper, a formal model for service choreography based on WS-CDL language is proposed. This model explores the key concepts related to choreography, such as passing channel, fault handling and finalization mechanisms. This study... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Guarded Workflow Language and Its Formal Semantics

    Publication Year: 2010, Page(s):25 - 34
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (421 KB) | HTML iconHTML

    Many information systems hold data of considerable value, and are subject to complex constraints and business rules. In these systems, update operations are often carefully described, to the extent that it is possible to derive a formal specification of their applicability and effect. Where an update is performed by means of a workflow, as a combination of operations, then it may be advantageous t... View full abstract»

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

    Publication Year: 2010, Page(s):35 - 44
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (373 KB) | HTML iconHTML

    Within the MDA context, model transformations (MT) play an important role as they ensure consistency and significant time savings. Several MT frameworks have been deployed and successfully used in practice. Like for any software, the development of MT programs is error prone. However there is limited support for verification and validation in current MDA technologies. This paper presents an approa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Certifying Compiler for Clike Subset of C Language

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

    Proof-carrying code (PCC) is a technique that allows code consumers to check whether the code is safe to execute or not through a formal safety proof provided by the code producer. And a certifying compiler makes PCC practical by compiling annotated source code into low-level code and proofs. In this paper we present a certifying compiler for a subset of the C programming language, named Clike, wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stack Bound Inference for Abstract Java Bytecode

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

    Ubiquitous embedded systems are often resource-constrained. Developing software for these systems should take into account resources such as memory space. In this paper, we develop and implement an analysis framework to infer statically stack usage bounds for assembly-level programs in abstract Java Byte code. Our stack bound inference process, extended from a theoretical framework proposed earlie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Improved Algorithm for Building the Characterizing Set

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

    FSM-based testing can obviously reduce the cost of test generation. So many FSM-based test generation methods have been presented to generate effective test sequences. Most of them need to construct the characterizing set of the FSM. However, there are two disadvantages in the existing algorithm for building the characterizing set. One is that time efficiency of the algorithm is hard access to our... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Runtime Verification with Multi-valued Formula Rewriting

    Publication Year: 2010, Page(s):77 - 86
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (385 KB) | HTML iconHTML

    Runtime verification is a promising method that tries to bridge the gap between formal methods and traditional testing. In this paper, we present an improved runtime verification method via multi-valued formula rewriting. A 3-valued executable semantics for finite trace LTL is formally defined, and an algorithm based on this new semantics is proposed and implemented in Maude, which is a high perfo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Axiomatic Temporal Logic Programs Verification

    Publication Year: 2010, Page(s):87 - 94
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (373 KB) | HTML iconHTML

    In this paper, we investigate the axiomatic system of Modeling Simulation and Verification Language (MSVL). To this end, a set of state axioms and state inference rules is given. They are useful to deduce a program into its normal form. Further, a propositional projection temporal logic is used as assertion language to describe the required property of a program. Moreover, to deduce a program over... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Theoretical Foundation of Meta-Modelling in Graphically Extended BNF and First Order Logic

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

    Meta-modeling plays an important role in model driven software development methodology. In our previous work, a graphic extension of BNF (GEBNF) was proposed to define the abstract syntax of graphic modeling languages. From a GEBNF syntax definition, a first order predicate logic language can be induced so that meta-modeling can be performed formally by specifying a predicate on the domain of synt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and Analysis of Reconfigurable Systems Using Flexible Petri Nets

    Publication Year: 2010, Page(s):107 - 116
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (398 KB) | HTML iconHTML

    Using Petri nets to model reconfigurable systems, where structure changes during runtime, have been one of the research axes in high level Petri nets domain. Numerous formalisms with different particularities have been proposed. These formalisms try to deal with some aspects of these systems. In the present paper, we propose a new PNets-based formalism “Flexible Nets” that we conside... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Property Checking for 1-Place-Unbounded Petri Nets

    Publication Year: 2010, Page(s):117 - 125
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB) | HTML iconHTML

    The reachability tree for an unbounded net system is infinite. By using ω symbol to represent infinitely many markings, coverability tree can provide a finite form. However, with too much information lost, it can not check properties such as reachability, deadlock freedom, liveness, etc. In this paper, an improved reachability tree (IRT for short) is constructed to enrich the ω repre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model Checking Rectangular Hybrid Systems with Timed Computation Tree Logic

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

    To deal with the model checking issue of rectangular hybrid systems, a constraint system called hybrid zone is introduced for the representation and manipulation of rectangular hybrid automata state-spaces. Model checking procedures for rectangular hybrid systems based on timed computation tree logic are given. The hybrid zone is proved to be closed to the operations required in these model checki... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bisimulations for Open Processes in Higher Order p-Calculus

    Publication Year: 2010, Page(s):135 - 144
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (425 KB) | HTML iconHTML

    In this paper, we propose open bisimulations for open processes in higher order π-calculus. The equivalence of open bisimulations and other bisimulations for open processes is proved. Furthermore, we present a symbolic operational semantics of higher order open processes, and give some symbolic bisimulations for higher order processes. The relation between symbolic bisimulations and other b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specification, Verification and Implementation of Business Processes Using CSP

    Publication Year: 2010, Page(s):145 - 154
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (435 KB) | HTML iconHTML

    Nowadays, the problem in business process management (BPM) is that BPM systems should both be easy to use for business process developers and be based on a sound formal method. Business process management systems are often based on semiformal modeling techniques such as event-driven process chains (EPC) or UML. Unlike semiformal modeling techniques, the process calculus CSP comes with mature verif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental Invariant Generation for Compositional Design

    Publication Year: 2010, Page(s):157 - 167
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (458 KB) | HTML iconHTML

    We consider a compositional method for the verification of component-based systems described in a subset of the BIP language encompassing multi-party interactions. The method is based on the use of two kinds of invariants. Component invariants are over-approximations of components' reach ability sets. Interaction invariants are constraints on the states of components involved in interactions. In t... View full abstract»

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