By Topic

Theoretical Aspects of Software Engineering (TASE), 2012 Sixth International Symposium on

Date 4-6 July 2012

Filter Results

Displaying Results 1 - 25 of 52
  • [Cover art]

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

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

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

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

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

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

    Publication Year: 2012, Page(s):x - xi
    Request permission for commercial reuse | PDF file iconPDF (146 KB)
    Freely Available from IEEE
  • Additional reviewers

    Publication Year: 2012, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (67 KB)
    Freely Available from IEEE
  • Overview of TASE 2012 Talk on Search Based Software Engineering

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

    This is an overview of the keynote presentation on SBSE at the Sixth IEEE International Symposium on Theoretical Aspects of Software Engineering (TASE 2012), held on the 4th-6th July 2012 in Beijing, China. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From Verification to Specification Inference

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

    Traditionally, the focus of specification mechanism has been on improving its ability to cover a wider range of problems more accurately, while the effectiveness of verification is left to the underlying theorem provers. Our work attempts a novel approach, where the focus is on designing good specification mechanisms to achieve better expressivity (the specification should capture more accurately ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symbolic Model Checking for Propositional Projection Temporal Logic

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

    This paper presents a symbolic model checking algorithm for Propositional Projection Temporal Logic (PPTL). Within this method, the model of a system is specified by a Kripke structure M, and the desired property is specified in a PPTL formula P. First, M is symbolically represented with boolean functions while -P is transformed into its normal form. Then the set of states in M that satisfies -P, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal Specification and Probabilistic Verification of SysML Activity Diagrams

    Publication Year: 2012, Page(s):17 - 24
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (445 KB) | HTML iconHTML

    Model-driven engineering refers to a range of engineering approaches that uses models throughout systems and software development life cycle. Towards sustaining the success in practice of model-driven engineering, we present a probabilistic verification framework supporting the analysis of SysML activity diagrams against a set of quantitative and qualitative requirements. To this end, we propose a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modelling and Analysis of Smart Grid: A Stochastic Model Checking Case Study

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

    Cyber-physical systems integrate information and communication technology functions to the physical elements of a system for monitoring and controlling purposes. The conversion of traditional power grid into a smart grid, a fundamental example of a cyber-physical system, raises a number of issues that require novel methods and applications. In this context, an important issue is the verification o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strong Preservation by Model Deformation

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

    Reliable and secure system design requires an increasing number of methods, algorithms, and tools for automatic program manipulation. Any program change corresponds to a transformation that affects the semantics at some given level of abstraction. We call these techniques model deformations. In this paper we propose a mathematical foundation for completeness-driven deformations of transition syste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal Verification of Netlog Protocols

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

    Data centric languages, such as recursive rule based languages, have been proposed to program distributed applications over networks. They greatly simplify the code, while still admitting efficient distributed execution, including on sensor networks. From previous work [1], we know that they also provide a promising approach to another tough issue about distributed protocols: their formal verifica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated Verification of the FreeRTOS Scheduler in HIP/SLEEK

    Publication Year: 2012, Page(s):51 - 58
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (261 KB) | HTML iconHTML

    Automated verification of operating system kernels is a challenging problem, partly due to the use of shared mutable data structures. In this paper, we show how we can automatically verify memory safety and functional correctness of the task scheduler component of the FreeRTOS kernel using the verification system HIP/SLEEK. We show how some of HIP/SLEEK features like user-defined predicates and le... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal Specification of Hybrid MARTE Statecharts

    Publication Year: 2012, Page(s):59 - 66
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (317 KB) | HTML iconHTML

    The specification of Modeling and Analysis of Real-time and Embedded Systems (MARTE) is an extension of UML in the domain of real-time and embedded Systems. However, unified modeling of continuous and discrete variables in MARTE is still an unsolved problem for hybrid real-time system development. In this paper we propose an extended statechart, Hybrid MARTE statechart, for modeling and analyzing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incorporating Constraints to Software System Survivability Specification and Proof

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

    In component-based and model-driven approaches for software engineering, any software components or subsystems acquired from external sources must meet a user's criteria to ascertain that they will not compromise the survivability properties of the existing systems. In this paper, we study survivability compliance specification and verification in a proof-carrying scenario: a user defines survivab... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Logic for Accumulated-Weight Reasoning on Multiweighted Modal Automata

    Publication Year: 2012, Page(s):77 - 84
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    Multiweighted modal automata provide a specification theory for multiweighted transition systems that have recently attracted interest in the context of energy games. We propose a simple fragment of CTL that is able to express properties about accumulated weights along maximal runs of multiweighted modal automata. Our logic is equipped with a game-based semantics and guarantees both soundness (for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Frequency Linear-time Temporal Logic

    Publication Year: 2012, Page(s):85 - 92
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB) | HTML iconHTML

    We propose fLTL, an extension to linear-time temporal logic (LTL) that allows for expressing relative frequencies by a generalization of temporal operators. This facilitates the specification of requirements such as the deadlines in a realtime system must be met in at least 95% of all cases. For our novel logic, we establish an undecidability result regarding the satisfiability problem but identif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Calculus of Higher Order Safe Ambients and Its Bisimulations

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

    In this paper, we present a higher order ambient calculus HSAP, which is a higher order extension of SAP calculus. In HSAP, we extend higher order communication capability and administrator interaction capability. Higher order communication capability means that an ambients can be send to another ambients. Administrator interaction capability means that an ambients can interact with any ambients i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Improved Full Abstraction Approach to Analyzing Locality Semantics

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

    Concurrency semantics plays an important role in both concurrency theory and software engineering. Although many results on various concurrency semantics have been proposed, there is still room for improvement. This paper focuses on the locality semantics, an important non-interleaving semantics, based on studying the relationship between the located CCS and the π-calculus. We present a pra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model-Based Test Generation Using Evolutional Symbolic Grammar

    Publication Year: 2012, Page(s):111 - 118
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB) | HTML iconHTML

    We present a new model-based test generation approach using an extended symbolic grammar, which is used as a formal notation for enumerating test cases for communication and reactive systems. Our model-based test generation approach takes inputs a reactive system model, in Live Sequence Charts (LSCs), and a general symbolic grammar serving as preliminary test coverage criteria, performs an automat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating Model-Based Testing and Analysis Tools via Test Case Exchange

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

    Europe's industry in embedded system design is currently aiming for a better integration of tools that support their development, validation and verification processes. The idea is to combine model-driven development with model-based testing and model-based analysis. The interoperability of tools shall be achieved with the help of meta-models that facilitate the mapping between different modelling... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Regression Test Cases Generation Based on Automatic Model Revision

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

    Regression testing is a widely used way to assure the quality of modified software. It requires executing a suite of test cases to ensure that modifications do not introduce any negative impact to software behavior. To collect test cases in the suite that can reveal modifications, different versions of software must be compared carefully. Existing approaches, relying on manual examination on progr... View full abstract»

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