By Topic

First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07)

Date 6-8 June 2007

Filter Results

Displaying Results 1 - 25 of 56
  • First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering - Cover

    Publication Year: 2007, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (251 KB)
    Freely Available from IEEE
  • First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering - Title page

    Publication Year: 2007, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (36 KB)
    Freely Available from IEEE
  • First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering - Copyright

    Publication Year: 2007, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (43 KB)
    Freely Available from IEEE
  • First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering - Table of contents

    Publication Year: 2007, Page(s):v - viii
    Request permission for commercial reuse | PDF file iconPDF (48 KB)
    Freely Available from IEEE
  • Message from the Program Chairs

    Publication Year: 2007, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (32 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference Organization and Committees

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

    Publication Year: 2007, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (22 KB)
    Freely Available from IEEE
  • Varieties of Static Analyzers: A Comparison with ASTREE

    Publication Year: 2007, Page(s):3 - 20
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (603 KB) | HTML iconHTML

    We discuss the characteristic properties of ASTREE, an automatic static analyzer for proving the absence of runtime errors in safety-critical real-time synchronous control command C programs, and compare it with a variety of other program analysis tools. View full abstract»

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

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

    Security vulnerabilities are increasingly due to software. While we focus much of our attention today on code-level vulnerabilities, such as buffer overflows, we should be paying more attention to design-level vulnerabilities. Independently designed and implemented components may individually behave properly, but when put together, unanticipated interactions may occur. An unanticipated interaction... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstractions for Real Real-time Systems

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

    Summary form only given. From the earliest days, designers of real-time systems have had to decide how to manage the hardware-level mechanisms (such as interrupts and multi-level priorities) that have been provided to share the computing resources between competing demands. One approach is to ignore these mechanisms and use software techniques to schedule program segments; another is to align the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symmetry Reduced Model Checking for B

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

    Symmetry reduction is a technique that can help alleviate the problem of state space explosion in model checking. The idea is to verify only a subset of states from each class (orbit) of symmetric states. This paper presents a framework for symmetry reduced model checking of B machines, which verifies a unique representative from each orbit. Symmetries are induced by the deferred set; a key compon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-Valued Model Checking via Groebner Basis Approach

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

    The management of uncertainty and imprecision is becoming essential for modeling many real problems. Multivalued model checking, a generalization of classical model checking, is useful for analyzing models that contain uncertainty or inconsistency. This paper shows that Groebner bases can provide canonical symbolic representations for multi-valued logics, and therefore, can be applied to symbolic ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model Checking Software at Compile Time

    Publication Year: 2007, Page(s):45 - 56
    Cited by:  Papers (6)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (238 KB) | HTML iconHTML

    Software has been under scrutiny by the verification community from various angles in the recent past. There are two major algorithmic approaches to ensure the correctness of and to eliminate bugs from such systems: software model checking and static analysis. Those approaches are typically complementary. In this paper we use a model checking approach to solve static analysis problems. This not on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Approach based on Bigraphical Reactive Systems to Check Architectural Instance Conforming to its Style

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

    With the spread of the Internet and software evolution in complex intensive systems, software architecture often need be reconfigured during run time in dynamic, heterogeneous environments in order to satisfy design objectives, which poses new problems such as, does the architecture of a system conform to the given architectural style? Existing formal methods for the conformance check are either o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Formal Derivation of Grover's Quantum Search Algorithm

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

    In this paper we aim at applying established formal methods techniques to a recent software area: quantum programming. In particular, we aim at providing a stepwise derivation of Grover's quantum search algorithm. Our work shows that, in principle, traditional software engineering techniques such as specification and refinement can be applied to quantum programs. We have chosen Grover's algorithm ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unified Modeling and Analysis based on Petri nets and Pi calculus

    Publication Year: 2007, Page(s):75 - 86
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (310 KB) | HTML iconHTML

    Awareness of the need for process orientation in IT support field has been increasing these decades, which made the modeling and analyzing of business process become more and more significant. Among various formal methods, Petri nets were applied in workflow management, mainly because its visible feature based on the rigors graph theory. As another potential candidate, Pi calculus, a branch of pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Object Type Graph System

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

    While object types are an abstract specification of object behaviors, object behaviors are significantly affected by method interdependencies in objects. Conventionally, method interdependency information of objects is not reflected in object types. As a result, objects with sufficiently distinct behaviors can be confused to have the same type in conventional type systems, which, among other thing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-adaptive Intrusion Detection System for Computational Grid

    Publication Year: 2007, Page(s):97 - 106
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (323 KB) | HTML iconHTML

    As conventional intrusion detection systems cannot evolve with ceaselessly changing environment of computational Grid, a model of intrusion detection system named GIDIA based on immunity and multi Agents is developed with hierarchical architecture. Following definitions of immune model, detecting Agent, decision-making Agent, preventing Agent, and controlling Agent, relevant abstract mathematical ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Foundational certification of data-flow analyses

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

    Data-flow analyses, such as live variables analysis, available expressions analysis etc., are usefully specifiable as type systems. These are sound and, in the case of distributive analysis frameworks, complete wrt. appropriate natural semantics on abstract properties. Applications include certification of analyses and "optimization" of functional correctness proofs alongside programs. On the exam... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Certified Thread Library for Multithreaded User Programs

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

    Ensuring the safety of multithreaded software is a task both important and challenging. Currently, most ap- proaches focus on the safety of multithreaded programs rather than the runtime based on which those concurrent programs run. In order to fundamentally solve this problem, a method of ensuring the safety of the runtime should be de- veloped. Such a runtime could be organized as a thread libra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of a Certifying Compiler Supporting Proof of Program Safety

    Publication Year: 2007, Page(s):127 - 138
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (169 KB) | HTML iconHTML

    Safety is an important property of high-assurance software, and one of the hot research topics on it is the verification method for software to meet its safety policies. In our previous work, we designed a pointer logic system and proposed a framework for developing and verifying safety critical programs. And in this paper, we present the design and implementation of a certifying compiler based on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Semantic Preorder on Refinement and Fairness

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

    We suggest a preorder notion for Stable Configuration Structures as a semantic model of concurrent systems. It combines the notions of observation-congruence-like fairness and the refinement operation for the specification and analysis of different levels of abstraction. We prove that our notion can be integrated into a lattice showing the interplay between the interleaving/causal semantics and th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generation of optimal finite test suites for timed systems

    Publication Year: 2007, Page(s):149 - 158
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    One of the main problems to test timed systems is that the tester has to decide when to apply the next input to the system under test. Even though the tester could determine good sequences of inputs to find a big variety of errors, the quality of the test suite usually depends on the time when the different parts of the sequences are applied. In this paper we give a formal methodology to provide g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Test Selection Criteria for Modal Specifications of Reactive Systems

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

    In the framework of functional testing from algebraic specifications, the strategy of test selection which has been widely and efficiently applied is based on axiom unfolding. In this paper, we propose to extend this selection strategy to a modal formalism used to specify dynamic and reactive systems. Such a work is then a first step to tackle testing of such systems more abstractly than most of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource-Constrained Workflow Modeling

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

    Business processes are often constrained by resource availability. This is particularly true in an emergency response system where large quantity of resources, including emergency responders, ambulances, fire trucks, medications, food, clothing, etc., are required. In our previous work, we introduced WIFA model to meet the needs of incident command systems workflow modeling and analysis. In this p... View full abstract»

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