# 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering

## Filter Results

Displaying Results 1 - 25 of 67
• ### [Front cover]

Publication Year: 2009, Page(s): C1
| PDF (4880 KB)
• ### [Title page i]

Publication Year: 2009, Page(s): i
| PDF (97 KB)
• ### [Title page iii]

Publication Year: 2009, Page(s): iii
| PDF (180 KB)

Publication Year: 2009, Page(s): iv
| PDF (134 KB)

Publication Year: 2009, Page(s):v - ix
| PDF (163 KB)
• ### Message from the Chairs

Publication Year: 2009, Page(s): x
| PDF (131 KB) | HTML
• ### TASE 2009 Committee Lists

Publication Year: 2009, Page(s):xi - xii
| PDF (87 KB)
• ### TASE 2009 Additional Reviewers

Publication Year: 2009, Page(s): xiii
| PDF (70 KB)
• ### Verification and Performance Analysis for Embedded Systems

Publication Year: 2009, Page(s):3 - 4
Cited by:  Papers (2)
| | PDF (162 KB) | HTML

This talk provides a thorough tutorial of the UPPAAL tool suite for, modeling, simulation, verification, optimal scheduling, synthesis, testing and performance analysis of embedded and real-time systems. View full abstract»

• ### Modular Development of Certified System Software

Publication Year: 2009, Page(s): 5
| | PDF (89 KB) | HTML

Certified software consists of a machine executable program plus a rigorous formal proof (checkable by computer) that the software is free of bugs with respect to a particular specification. The conventional wisdom is that certified software will never be practical because any real software must also rely on the underlying operating system which is too low-level and complex to be verifiable. In re... View full abstract»

• ### Towards Expressive Specification and Efficient Model Checking

Publication Year: 2009, Page(s): 9
Cited by:  Papers (2)
| | PDF (176 KB) | HTML

We share the views that specifications are preferably executable. In this tutorial, we introduce our latest effort on combining the expressiveness of integrated formal specification languages with the power of mechanical system analysis method like model checking. We present a process analysis toolkit (PAT) which is a self-contained framework for system specification, simulation and verification. ... View full abstract»

• ### Improving Responsiveness of Hard Real-Time Embedded Systems

Publication Year: 2009, Page(s):13 - 20
| | PDF (311 KB) | HTML

Hard real-time systems are found in many critical embedded applications, for example aeroplane flight control, industrial production line control, and so on. The safe scheduling of tasks in these hard real-time systems is crucial to their correct operation, but the hard constraints of this type of scheduling reduce the responsiveness of the systems. In this paper we show the application of runtime... View full abstract»

• ### Environmental Simulation of Real-Time Systems with Nested Interrupts

Publication Year: 2009, Page(s):21 - 28
Cited by:  Papers (7)
| | PDF (532 KB) | HTML

Interrupts are important aspects of real-time embedded systems to handle events in time. When there exist nested interrupts in a real-time system, and an urgent interrupt is allowed to preempt the current interrupt handling, the design and analysis of the system become difficult due to the lack of appropriate behavioral models. This paper proposes a compositional model for nested interrupts and an... View full abstract»

• ### Semantics for Communicating Actors with Interdependent Real-Time Deadlines

Publication Year: 2009, Page(s):29 - 35
| | PDF (264 KB) | HTML

Models of embedded systems with communicating actors and deadlines offer abstraction and encapsulation of related functionality, but their behavior is complex. Verification is therefore difficult and requires a combination of simulation, model checking and testing tools. In order to rely on the results, these tools must use consistent semantics for the model. Yet, a monolithic semantic model is ju... View full abstract»

• ### An Efficient Algorithm for Finding Empty Space for Reconfigurable Systems

Publication Year: 2009, Page(s):36 - 43
| | PDF (276 KB) | HTML

The management of resources in reconfigurable systems is one of the most critical factors concerned deeply with the performance of dynamic reconfigurable systems. There are several algorithms for managing the empty space of reconfigurable systems, among which the basic scan line algorithm (SLA) is a relative efficient one. However, SLA suffers from two problems: redundancy and duplication. To solv... View full abstract»

• ### State Visibility and Communication in Unifying Theories of Programming

Publication Year: 2009, Page(s):47 - 54
Cited by:  Papers (1)
| | PDF (182 KB) | HTML

We explore the interactions between program-variable state visibility and communication behaviour in state-rich CSP-like processes, using the unifying theories of programming (UTP) framework. The key results of this work are: having variable state visible while a process is waiting to communicate, results in an operationally complex theory of behaviour; by contrast, considering state as unobservab... View full abstract»

• ### Semantics of Metamodels in UML

Publication Year: 2009, Page(s):55 - 62
Cited by:  Papers (4)
| | PDF (498 KB) | HTML

A modelling language can be defined by a metamodel in UML class diagram. This paper defines the semantics of such metamodels through two mappings: a signature mapping from metamodels to signatures of first order languages and an axiom mapping from metamodels to sets of axioms over the signature. Valid models, i.e. instances of the metamodel, are therefore mathematical structures in the signature t... View full abstract»

• ### Refinement Algebra with Explicit Probabilism

Publication Year: 2009, Page(s):63 - 70
Cited by:  Papers (1)
| | PDF (343 KB) | HTML

Refinement algebra provides axioms for the stepwise removal of abstraction, in the form of demonic nondeterminism, in a first-order system that supports reasoning about loops. It has been extended by Solin and Meinecke to computations involving implicit probabilistic choices: demonic nondeterminism then satisfies weaker properties. In this paper their axiom system is extended to capture explicit p... View full abstract»

• ### Environment Abstraction with State Clustering and Parameter Truncating

Publication Year: 2009, Page(s):73 - 80
Cited by:  Papers (1)
| | PDF (200 KB) | HTML

Environment abstraction enriches predicate abstraction by idea from counter abstraction to develop a framework for verification of parameterized systems. However, despite various effects, the constructed abstractions still go beyond the capability of the usual model checkers for many realistic systems. In this paper, a new technique, called state clustering, is proposed to group local states into ... View full abstract»

• ### Verification of Population Ring Protocols in PAT

Publication Year: 2009, Page(s):81 - 89
Cited by:  Papers (2)
| | PDF (209 KB) | HTML

The population protocol model has emerged as an elegant paradigm for describing mobile ad hoc networks, consisting of a number of nodes that interact with each other to carry out a computation. One essential property of self-stabilizing population protocols is that all nodes must eventually converge to the correct output value, with respect to all possible initial configurations. It has been shown... View full abstract»

• ### Bounded Model Checking of ACTL Formulae

Publication Year: 2009, Page(s):90 - 99
Cited by:  Papers (1)
| | PDF (347 KB) | HTML

In this paper, we give a new and improved Bounded Model Checking encoding method for the universal fragment of CTL (ACTL). More specifically, the new encoding method works for verification of ACTL properties, instead of error-hunting. Combine our verification encoding and bug-hunting encoding proposed before, we get a Bounded Model Checking procedure that works for both valid and invalid ACTL prop... View full abstract»

• ### Coarse Grained Retrenchment and the Mondex Denial of Service Attacks

Publication Year: 2009, Page(s):103 - 110
| | PDF (234 KB) | HTML

Retrenchment is a framework that allows relatively unrestricted system evolution steps to be described in a way that gives an evolution step some formal content - unlike model based refinement, whence it emerged, which is inapplicable outside some fairly tightly drawn notion of progress towards implementation'. In this paper, we introduce a coarse grained' version of retrenchment, relating to sy... View full abstract»

• ### Enforcing Constraints on Life Cycles of Business Artifacts

Publication Year: 2009, Page(s):111 - 118
Cited by:  Papers (4)
| | PDF (263 KB) | HTML

Artifact-centric business process models allow to describe artifacts (data objects) and their life cycles, which allow designers to focus on individual artifact in business processes, thus simplifies the design and analysis of business process model. However, this feature is a double-edged sword. The description of the relationships between artifacts becomes a new and nontrivial problem. It is bet... View full abstract»

• ### Consistency Checking for LSC Specifications

Publication Year: 2009, Page(s):119 - 126
Cited by:  Papers (4)
| | PDF (403 KB) | HTML

Live sequence charts (LSCs) have been proposed as an inter-object scenario-based specification and visual programming language. In this paper, we introduce a high level computational semantics of LSCs, in the form of a PLAY-tree, to show how a running LSC affects the system behaviors in response to a set of external events. Given a nonempty regular language of external events,the consistency of an... View full abstract»

• ### Integrating Specification and Programs for System Modeling and Verification

Publication Year: 2009, Page(s):127 - 135
Cited by:  Papers (32)
| | PDF (228 KB) | HTML

High level specification languages like CSP use mathematical objects as abstractions to represent systems and processes. System behaviors are described as process expressions combined with compositional operators, which are associated with elegant algebraic laws for system analysis. Nonetheless, modeling systems with non-trivial data and functional aspects using CSP remains difficult. In this work... View full abstract»