By Topic

2011 Fifth International Conference on Theoretical Aspects of Software Engineering

29-31 Aug. 2011

Filter Results

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

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

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

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

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

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

    Publication Year: 2011, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (110 KB) | HTML iconHTML
    Freely Available from IEEE
  • Programme Committee

    Publication Year: 2011, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (109 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2011, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (94 KB)
    Freely Available from IEEE
  • Making Program Logics Intelligible

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

    To verify program specifications, rather than generic safety properties, it will be necessary to integrate verification into the process of programming. Program proving is unlike theorem proving in mathematics mathematical conjectures may give no hint as to how they could be proved, but programs are written by programmers, who must understand informally why their programs work. The job of verifica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic Specification-Based Testing: Challenges and Possibilities

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

    Automatic specification-based testing has long been a goal of software engineering, but due to various challenges and difficulties, the goal still remains far from realized. If the specification is informal, full automation would be impossible in general. Formal specification improves the situation, but there are many barriers lying ahead. Automatic test set generation can be difficult to meet hig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Tagging Protocol for Asynchronous Testing

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

    Conformance testing has a rich underlying theory popularly called IOCO-test theory. In the realm of IOCO-test theory, this paper addresses the issue of testing a component of an asynchronously communicating distributed system. Testing a system which communicates asynchronously (i.e., through some medium) with its environment is more difficult than testing a system which communicates synchronously ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Inheritance and Modularity in Specification and Verification of OO Programs

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

    Specification and verification for object oriented (OO) programs remains a great challenge despite of decades' efforts. To address the problem, we propose a novel specification and verification framework, which supports abstraction and offers modularity via a set of scope and inheritance rules, and a concept calledemph{specification predicate}. The framework covers the most important OO features l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formalizing Application Programming Interfaces of the OSEK/VDX Operating System Specification

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

    OSEK/VDX Operating System Specification is a standard in automotive industry with a long history. Dozens of mature industrial operating systems are based on this specification and widely applied in the products of major automotive manufacturers. The verification of the operating system products is always a hard nut to crack. In this paper, we propose a formal specification of OSEK/VDX Operating Sy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Refactoring Object-Oriented Specifications with Inheritance-Based Polymorphism

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

    Specification notations such as JML and Spec# which are embedded into program code provide a promising approach to formal object-oriented software development. If the program code is refactored, however, the specifications need also to be changed. This can be facilitated by specification refactoring rules which allows such changes to be made systematically along with the changes to the code. A set... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Focus Game for Projection Temporal Logic

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

    Focus game is applied to Prepositional Projection Temporal Logic with infinite models (PPTL) for the satisfiability and model checking of PPTL formulas. To this end, normal form and complete normal form are introduced, and through which sub-formulas are defined for PPTL formulas. Accordingly, focus game G(R) is constructed for checking the satisfiability of PPTL formula R; and G(s,R) is built for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Automatic Reasoning Mechanism for NFR Goal Models

    Publication Year: 2011, Page(s):52 - 59
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (942 KB) | HTML iconHTML

    Software requirements, especially non-functional requirements, are considered as vital prerequisites for producing software of high quality. As widely accepted, non-functional goal modeling like the NFR Framework usually employs tree modeling style, and presents an interactive process for the analysis of nonfunctional requirements. However, there still exist some problems during the identification... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Resolution Based Algorithm for SAT

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

    Propositional satisfiability problem (SAT) is a fundamental problem both in theory and practice. In the area of software engineering, people employ various techniques, such as model checking, theorem proving, automated testing and so on, to ensure the quality of software. Those techniques are usually based on SAT solvers. The efficiency is an important criterion for a good SAT solver. Besides, the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Symbolic Algorithm for Shortest EG Witness Generation

    Publication Year: 2011, Page(s):68 - 75
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB) | HTML iconHTML

    Witness generation is a fundamental model checker feature, but generating shortest witnesses for an EG CTL formula has long been a difficult problem of both theoretical and practical relevance. We propose a symbolic approach to shortest EG witness generation based on edge-valued multi-way decision diagrams. We employ a fix point symbolic iteration to compute the transitive closure enhanced with di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Generative Approach to Searching Algorithmic Programs Development

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

    Using highly configurable semi-automatic approach to algorithmic programs development can improve correctness and productivity. This paper explores a way to use generative techniques to produce the algorithmic programs for searching problem. Based on PAR method and PAR platform, it is to formally develop generic type component and algorithm components, and to design a formal algorithm generative m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Categorical Modeling Approach of Aspect-Oriented Systems

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

    Aspect Oriented (AO) Technology is a post-object oriented technology emerged to overcome limitations of Object Oriented (OO) Technology, such as the cross-cutting concern problem. Aspect Oriented Programming (AOP) also offers modularity and traceability benefits. Yet, reasoning, specification, and verification of AO systems present unique challenges especially as such systems evolve over time. Con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model Checking Multirate Hybrid Systems with Restricted Convex Polyhedron

    Publication Year: 2011, Page(s):93 - 99
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (305 KB) | HTML iconHTML

    Model checking is a promising and powerful approach to automatic verification of systems. To deal with the model checking issue of multirate hybrid systems, a constraint system called multirate zone is formalized for the representation and manipulation of multirate hybrid automata state-spaces. A multirate zone is a restricted convex polyhedron represented by a conjunction of inequalities comparin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Behaviour Recognition Using Chronicles

    Publication Year: 2011, Page(s):100 - 107
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (601 KB) | HTML iconHTML

    Chronicles are used to describe behaviours, e.g. when (un) desired behaviours should be detected within an event flow, for instance in aerospace system studies. In this paper we first introduce a language to describe chronicles and event related notions, before defining a denotational semantics of a chronicle recognition within an event flow. We present an operational semantics of chronicle recogn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate Bisimulation for Metric Doubly Labeled Transition System

    Publication Year: 2011, Page(s):108 - 114
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (225 KB) | HTML iconHTML

    Many researchers suggested extending bisimilarity to quantitative versions to avoid the rigidity of classical bisimilarity. To explore the relation between different notions of approximate bisimilarity mentioned in literature, in this paper, we present a quantitative extension of doubly labeled transition systems, MDLTS, where its states and actions form metric spaces. We then introduce two notion... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Java Goes TLA+

    Publication Year: 2011, Page(s):117 - 124
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB) | HTML iconHTML

    This paper introduces the Inverse Implementation method, that augments classical software development processes by a step of formal conformity verification. Our method is based on a formal model of the machine that executes programs of the chosen programming language. The model can automatically be combined with the code of a concrete program to gain a model of the execution of that program. The e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Simple Model for Certifying Assembly Programs with First-Class Function Pointers

    Publication Year: 2011, Page(s):125 - 132
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB) | HTML iconHTML

    First-class function pointers are common in low-level assembly languages. Higher-level features such as closures, virtual functions, and call-backs are all compiled down to assembly code with function pointers. Function pointers are, however, hard to reason about. Previous program logics for certifying assembly programs either do not support first-class function pointers, or follow Continuation-Pa... View full abstract»

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