By Topic

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

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
  • Implementation of specification conjunction and domain interaction in Rosetta

    Publication Year: 2001
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (95 KB) | HTML iconHTML

    Summary form only given. System level design is nowadays a complex process due to heterogeneity of domains of components in a single system. The language standard, Rosetta, was proposed as a means to help in such designs. An important feature in Rosetta is known as domain interaction and involves the analysis of interaction between models from domain to domain. The resulting iteration models can t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic translation from UML specifications to B

    Publication Year: 2001
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (106 KB) | HTML iconHTML

    Summary form only given. The research to merge the relatively simple and graphical nature of UML with the firm semantics bases of B has been mentioned several time in the literature. The goal is to propose automatic derivation schemes from UML to B specifications. Then, the construction of UML specifications is rigorously controlled by analyzing derived a specifications thanks to powerful B suppor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model-checking real-time concurrent systems

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

    Summary form only given, as follows. A concurrent real-time system is a system of many components, that should deliver the result in a particular time interval. The design of such a system is generally complex, with high possibility of errors. Thus it is very important to be able to verify the correctness of the design itself, before going on to implementation stage. Model-checking is a powerful a... 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 (81 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.
  • Author index

    Publication Year: 2001, Page(s):441 - 442
    Request permission for commercial reuse | PDF file iconPDF (100 KB)
    Freely Available from IEEE
  • Semi-automated verification of Erlang code

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

    Erlang is a functional programming language with support for concurrency and message passing communication that is used at Ericsson for developing telecommunication applications. We consider the challenge of verifying temporal properties of systems programmed in Erlang with dynamically evolving process structures. To accomplish this, a rich verification framework for goal-directed, proof system-ba... 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.
  • AGATE, access graph based tools for handling encapsulation

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

    Encapsulation and modularity are supported by various static access control mechanisms that manage implementation hiding and define interfaces adapted to different client profiles. Programming languages use numerous and very different mechanisms, the cumulative application of which is sometimes confusing and hard to predict. Furthermore, understanding and reasoning about access control independent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining static analysis and model checking for software analysis

    Publication Year: 2001, Page(s):262 - 269
    Cited by:  Papers (11)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (833 KB) | HTML iconHTML

    We present an iterative technique in which model checking and static analysis are combined to verify large software systems. The role of the static analysis is to compute partial order information which the model checker uses to reduce the state space. During exploration, the model checker also computes aliasing information that it gives to the static analyzer which can then refine its analysis. T... 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
    Cited by:  Papers (1)
    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.
  • Exploiting heap symmetries in explicit-state model checking of software

    Publication Year: 2001, Page(s):254 - 261
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (803 KB) | HTML iconHTML

    Detecting symmetries in the structure of systems is a well known technique falling in the class of bisimulation (strongly) preserving state space reductions. Previous work in applying symmetries to aid model checking focuses mainly on process topologies and user specified data types. We applied the symmetry framework to model checking object-based programs that manipulate dynamically created objec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Program execution based module cohesion measurement

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

    Module cohesion describes the degree to which different actions performed by a module contribute towards a unified function. High module cohesion is a desirable property of a program. The program modifications during successive maintenance interventions can have negative effect on the structure of the program resulting in less cohesive modules. Therefore, metrics that measure module cohesion are i... 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.
  • Enhancing partial-order reduction via process clustering

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

    Partial-order reduction is a well-known technique to cope with the state-space-explosion problem in the verification of concurrent systems. Using the hierarchical structure of concurrent systems, we present an enhancement of the partial-order-reduction scheme of G.J. Holzman and D. Peled (1995) and D. Peled (1994). A prototype of the new algorithm has been implemented on top of the verification to... 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 (56)
    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.
  • Tailoring a COTS group support system for software requirements inspection

    Publication Year: 2001, Page(s):201 - 208
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1001 KB) | HTML iconHTML

    The inspection of early life-cycle artifacts such as requirement documents promises great benefits. However, research demonstrates that the inspection process is complex and expensive and that tool support would be highly desirable. Existing inspection tools focus largely on the inspection of source code. We have therefore devised groupware support for inspecting requirements. Based on our experie... 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 (6)
    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.
  • 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.
  • Test purposes: adapting the notion of specification to testing

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

    Nowadays, test cases may correspond to elaborate programs. It is therefore sensible to try to specify test cases in order to get a more abstract view of these. This paper explores the notion of test purpose as a way to specify a set of test cases. It shows how test purposes are exploited today by several tools that automate the generation of test cases. It presents the major relations that link te... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Context-aware browsing of large component repositories

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

    The paper proposes a novel approach to locating software components from a large component repository: context-aware browsing. Without any explicit input from software developers, this approach automatically locates and presents a list of software components that could possibly be used in the current development situation. This automation of the component location process not only greatly reduces ... 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 (5)
    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.
  • Specification modeling and validation applied to a family of network security products

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

    A high-bandwidth, always-on Internet connection makes computers in homes and small offices attractive targets for network-based attacks. Network security gateways can protect such vulnerable hosts from attackers, but differing sets of customer needs require different feature mixes. The safest way to address this market is to provide a family of products, each member of which requires little or no ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generation of distributed system test-beds from high-level software architecture descriptions

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

    Most distributed system specifications have performance benchmark requirements. However, determining the likely performance of complex distributed system architectures during development is very challenging. We describe a system where software architects sketch an outline of their proposed system architecture at a high level of abstraction, including indicating client requests, server services, an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analysis-revision cycle to evolve requirements specifications

    Publication Year: 2001, Page(s):354 - 358
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB) | HTML iconHTML

    We argue that the evolution of requirements specifications can be supported by a cycle composed of two phases: analysis and revision. We investigate an instance of such a cycle, which combines two techniques of logical abduction and inductive learning to analyze and revise specifications respectively. View full abstract»

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