By Topic

Automated Software Engineering, 2001. (ASE 2001). Proceedings. 16th Annual International Conference on

Date 26-29 Nov. 2001

Filter Results

Displaying Results 1 - 25 of 70
  • Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001) [front matter]

    Publication Year: 2001
    Request permission for commercial reuse | PDF file iconPDF (265 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2001, Page(s):441 - 442
    Request permission for commercial reuse | PDF file iconPDF (100 KB)
    Freely Available from IEEE
  • Design rationale for software maintenance

    Publication Year: 2001
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (207 KB) | HTML iconHTML

    For a number of years, members of the artificial intelligence (AI) in design community have studied design rationale (DR), the reasons behind decisions made while designing. A record of what decisions were made, and why, is especially valuable for software maintenance. One reason for this is that the software lifecycle is a long one. Large projects may take years to complete and spend even more ti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Higher order function synthesis through proof planning

    Publication Year: 2001, Page(s):307 - 310
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB) | HTML iconHTML

    The close association between higher order functions and algorithmic skeletons is a promising source of automatic parallelisation of programs. An approach to automatically synthesizing higher order functions from functional programs through proof planning is presented Our work has been conducted within the context of a parallelising compiler for SML, with the objective of exploiting parallelism la... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic test data generation for programs with integer and float variables

    Publication Year: 2001, Page(s):13 - 21
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB) | HTML iconHTML

    The paper presents a novel approach for automated test data generation of imperative programs containing integer, boolean and/or float variables. Our approach is based on consistency techniques integrating integer and float variables. We handle statement, branch and path coverage criteria. Our purpose is thus to automatically generate test data that will cause the program to execute a statement, t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enforcing business policies through automated reconfiguration

    Publication Year: 2001, Page(s):426 - 429
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB) | HTML iconHTML

    In this paper, we address dynamic reconfiguration from the point of view of the enforcement of the policies that organisations wish to see imposed through the way information systems support business. We address the process of evolution by proposing a primitive-coordination context-for modelling the circumstances in which reconfiguration can and should take place. The idea is for business policies... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated software engineering using concurrent class machines

    Publication Year: 2001, Page(s):297 - 304
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (974 KB) | HTML iconHTML

    Concurrent Class Machines are a novel state-machine model that directly captures a variety of object-oriented concepts, including classes and inheritance, objects and object creation, methods, method invocation and exceptions, multithreading and abstract collection types. The model can be understood as a precise definition of UML activity diagrams which, at the same time, offers an executable, obj... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A tool for lazy verification of security protocols

    Publication Year: 2001, Page(s):373 - 376
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB) | HTML iconHTML

    We present the lazy strategy implemented in a compiler of cryptographic protocols, Casrul. The purpose of this compiler is to verify protocols and to translate them into rewrite rules that can be used by several kinds of automatic or semi-automatic tools for finding flaws, or proving properties. It is entirely automatic, and the efficiency of the generated rules is guaranteed because of the use of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The synthesis of a Java card tokenisation algorithm

    Publication Year: 2001, Page(s):43 - 50
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB) | HTML iconHTML

    We describe the development of a Java bytecode optimisation algorithm by the methodology of program extraction. We develop the algorithm as a collection of proofs and definitions in the Coq proof assistant, and then use Coq's extraction mechanism to automatically generate a program in OCaml. The extraction methodology guarantees that this program is correct. We discuss the feasibility of the metho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable consistency checking between diagrams - the VIEWINTEGRA approach

    Publication Year: 2001, Page(s):387 - 390
    Cited by:  Papers (16)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (521 KB) | HTML iconHTML

    The Unified Modeling Language (UML) supports a wide range of diagrams for modeling software development concerns. UML diagrams are independent but connected; their meta-model describes them under a common roof. Despite the advances of UML, we found that the problem of ensuring consistency between UML diagrams has not been solved. We have developed an approach for automated consistency checking, ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new way of automating statistical testing methods

    Publication Year: 2001, Page(s):5 - 12
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB) | HTML iconHTML

    We propose a novel way of automating statistical structural testing of software, based on the combination of uniform generation of combinatorial structures, and of randomized constraint solving techniques. More precisely, we show how to draw test cases which balance the coverage of program structures according to structural testing criteria. The control flow graph is formalized as a combinatorial ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatically restructuring programs for the Web

    Publication Year: 2001, Page(s):211 - 222
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1401 KB) | HTML iconHTML

    The construction of interactive server-side Web applications differs substantially from the construction of traditional interactive programs. In contrast, existing Web programming paradigms force programmers to save and restore control state between user interactions. We present an automated transformation that converts traditional interactive programs into standard CGI programs. This enables reus... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A concurrency test tool for Java monitors

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

    The Java programming language supports monitors. Monitor implementations, like other concurrent programs, are hard to test due to the inherent non-determinism. This paper presents the ConAn (Concurrency Analyser) tool for generating drivers for the testing of Java monitors. To obtain adequate controllability over the interactions between Java threads, the generated driver contains processes that a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling class operations in B: Application to UML behavioral diagrams

    Publication Year: 2001, Page(s):289 - 296
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (698 KB) | HTML iconHTML

    An appropriate approach for translating UML to B formal specifications allows one to use UML and B jointly in a unified, practical and rigorous software development. We formally analyze UML specifications via their corresponding B formal specifications. This point is significant because B support tools like AtelierB are available. We can also use UML specifications as a tool for building B specifi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Developing generative frameworks using XML

    Publication Year: 2001, Page(s):368 - 372
    Cited by:  Papers (1)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB) | HTML iconHTML

    Generative programming methods provide some significant advantages for the repeated deployment of product line architectures. The paper considers XML as a tool for building and describing applications that use generative programming methods. It describes techniques for the creation of a generative framework, presents a case study and discusses the results of practical application of these methods ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A UML validation toolset based on abstract state machines

    Publication Year: 2001, Page(s):315 - 318
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (659 KB) | HTML iconHTML

    The Unified Modeling Language has become widely accepted as a standard in software development. Several tools have been produced to support UML model validation. These tools translate a UML model into a validation language such as PROMELA. However they have some shortcomings: there is no proof of correctness (with respect to the UML semantics) for these tools; and there is no tool that supports va... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating EDI message translations from visual specifications

    Publication Year: 2001, Page(s):35 - 42
    Cited by:  Papers (6)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1473 KB) | HTML iconHTML

    Electronic data interchange (EDI) systems are used in many domains to support inter-organisational information exchange. To get systems using different EDI message formats to communicate, complex message translations (where data must be transformed from one EDI message format into another), are required. We describe a visual language and support environment which greatly simplify the task of the s... View full abstract»

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

    Publication Year: 2001, Page(s):382 - 386
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (570 KB) | HTML iconHTML

    Action Language is a specification language for reactive software systems. We present the Action Language Verifier which consists of: 1) a compiler that converts Action Language specifications to composite symbolic representations, and 2) an infinite-state symbolic model checker which verifies (or falsifies) CTL properties of Action Language specifications. Our symbolic manipulator (Composite Symb... View full abstract»

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

    Publication Year: 2001, Page(s):63 - 70
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (825 KB) | HTML iconHTML

    Assurance of software systems has traditionally been sought through the rigour of the development process. The higher the assurance, the more demanding the development process; the highest assurance requiring the use of formal methods during development. This approach has been followed for decades with some success, but increased assurance brings a disproportionate increase in cost and risk. A cha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Amphion/NAV: deductive synthesis of state estimation software

    Publication Year: 2001, Page(s):395 - 399
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (669 KB) | HTML iconHTML

    Previous work on domain-specific deductive program synthesis described the Amphion/NAIF system for generating Fortran code from high-level graphical specifications describing problems in space system geometry. Amphion/NAIF specifications describe input-output functions that compute geometric quantities (e.g., the distance between two planets at a point in time, or the time when a radio communicati... View full abstract»

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

    Publication Year: 2001, Page(s):232 - 241
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (951 KB) | HTML iconHTML

    Reverse engineering a program constructs a high-level representation suitable for various software development purposes such as documentation or reengineering. Unfortunately however, there are no established guidelines to assess the adequacy of such a representation. We propose two such criteria, completeness and accuracy, and show how they can be determined during the course of reversing the repr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic verification of Java design patterns

    Publication Year: 2001, Page(s):324 - 327
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (439 KB) | HTML iconHTML

    Design patterns are widely used by object oriented designers and developers for building complex systems in object oriented programming languages such as Java. However, systems evolve over time, increasing the chance that the pattern in its original form will be broken. We attempt to show that many design patterns (implemented in Java) can be verified automatically. Patterns are defined in terms o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Certifying domain-specific policies

    Publication Year: 2001, Page(s):81 - 90
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (977 KB) | HTML iconHTML

    Proof-checking code for compliance to safety policies potentially enables a product-oriented approach to certain aspects of software certification. To date, previous research has focused on generic, low-level programming-language properties such as memory type safety. In this paper we consider proof-checking higher-level domain-specific properties for compliance to safety policies. The paper first... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monitoring programs using rewriting

    Publication Year: 2001, Page(s):135 - 143
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (870 KB) | HTML iconHTML

    We present a rewriting algorithm for efficiently testing future time Linear Temporal Logic (LTL) formulae on finite execution traces. The standard models of LTL are infinite traces, reflecting the behavior of reactive and concurrent systems which conceptually may be continuously alive. In most past applications of LTL, theorem provers and model checkers have been used to formally prove that down-s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verify properties of mobile code

    Publication Year: 2001
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (198 KB) | HTML iconHTML

    Summary form only given. Given a program and a specification, you may want to verify mechanically and efficiently that this program satisfies the specification. Software verification techniques typically involve theorem proving. If a formal specification is easily available, consumption of computational resources is a major issue. Meanwhile, we shall not overlook the psychological factors. Often, ... View full abstract»

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