By Topic

Software Engineering Conference, 2001. APSEC 2001. Eighth Asia-Pacific

Date 4-7 Dec. 2001

Filter Results

Displaying Results 1 - 25 of 62
  • Tailoring and verifying software process

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

    Process tailoring and verification are very important since project-specific processes are tailored from an organizational process standard and many quality assurance activities are based on the process standard. However, existing research does not provide a systematic method for process tailoring and verification. In this paper, we propose a systematic method for formalizing a process standard cl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cost analysis of games, using program logic

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

    Summary form only given. Recent work in probabilistic programming semantics has provided a relatively simple probabilistic extension to predicate transformers, making it possible to treat small imperative probabilistic programs containing both demonic and angelic nondeterminism. That work in turn has extended to provide a probabilistic basis for the modal μ-calculus of Kozen (1983), and leads t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The design and implementation of automata-based testing environment for Java multi-thread programs

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

    Deterministic execution testing has been considered a promising method for concurrent program testing because of its reproducibility. However, since deterministic execution requires that a synchronization sequence to be replayed is feasible and valid, it is not directly applicable to a situation in which synchronization sequences, being valid but infeasible, are taken into account. To resolve this... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A rigorous method for testing real-time reactive systems

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

    Real-time reactive systems are complex systems to design and verify. Rigorous testing of real-time reactive systems complement the more difficult and expensive formal verification process. This paper discusses a rigorous method for block-box testing of real-time reactive systems, whose design specifications are given in the timed reactive object model (TROM) formalism. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partitioning program into hardware and software

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

    Hardware and software co-design is a design technique which delivers computer systems comprising hardware and software components. A critical phase of the codesign process is to decompose a program into hardware and software.. This paper proposes an algebraic partitioning method whose correctness is verified in the algebra of programs. We introduce the program analysis phase before program partiti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Knowledge scouts: Reducing communication barriers in a distributed software development project

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

    As a result of globalization, mergers, acquisitions, and scarce skills, software development is becoming increasingly distributed. Distribution, however, introduces major communication barriers, including time zone differences, cultural differences, and most project participants have never met face to face. In this paper, we focus on "knowledge scouts," developers who travel briefly to other sites... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An effective testing technique for component composition in EJBs

    Publication Year: 2001, Page(s):229 - 236
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (690 KB) | HTML iconHTML

    This paper proposes a new testing technique for component composition of EJBs. We define components made by a current developer as white box components and components made by another developer as black box components. Software from CBSD consists of black box components and white box components, and composition errors result from the interaction between black box components and white box components... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formalization and 'literate' programming

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

    The 'literate' programming model is extended to include a concept of mechanical transformation. A prototype tool, FLP (formal literate programming tool), has been developed which uses this extended 'literate' programming model in both a formal program proof setting, and within a formal (refinement) program development setting. In both settings, FLP provides history, access to tools, and an easy-to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic translation of a timed process algebra into dynamic state graphs

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

    In this paper we consider a timed process algebra based on classical LOTOS operators in order to specify the behaviour of concurrent systems and, concretely, those systems for which time becomes an important factor to take into account, such as real-time systems. One of the main goals of this paper is to define a translation into a kind of dynamic state graph, which is currently supported by a too... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A model for navigating interview processes in requirements elicitation

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

    Experts in requirements elicitation interview stakeholders using various levels of knowledge to grasp and elicit users' requirements. This paper analyzes expert interview processes and explores a computation model for simulating them. This model can be used to navigate a novice analyst's interview processes. It consists of a blackboard model and a state transition model in order to narrow the cand... View full abstract»

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

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

    Computer software now controls critical systems worldwide. International standards require such programs to be produced from mathematically-precise specifications, but the techniques and tools involved are highly complex and unfamiliar to most programmers. We present a formal basis for extending a tool already used by software developers, the program compiler, to undertake much of the task automat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Architectural design for evolution by analyzing requirements on quality attributes

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

    It is important to design architecture to be steady throughout the evolution, or make the architecture to be the platform for a product family. In order to design software architecture to have such characteristics we have to analyze the commonality and differences among requirements on potential software that are supposed to be developed on the architecture, and then design software architecture s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quality requirement elicitation for the architecture evaluation of process computer systems

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

    Architecture evaluation to confirm that the quality requirements were satisfied by the developed software architecture is one of the most important issues in architecture-based software development approaches. Architecture Tradeoff Analysis Method (ATAM) is one such method, and the scenario-based quality requirement elicitation is an important factor for applying the method. We applied the method ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Framework for third party testing of component software

    Publication Year: 2001, Page(s):431 - 434
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB) | HTML iconHTML

    To ensure that a component-based software system can run properly and effectively, the qualities of constituent components have to be assured. Third-party certification is a safe approach that buyers should trust when dealing with component software. However, current third-party certification methods do not support proper functional testing, which is the most important factor when selecting the co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A slicing method for object-oriented programs using lightweight dynamic information

    Publication Year: 2001, Page(s):273 - 280
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (685 KB) | HTML iconHTML

    Program slicing has been used for efficient program debugging activities. A program slice is computed by analyzing dependence relations between program statements. We can divide dependence analyses into two categories, static and dynamic; the former requires small analysis costs, but the resulting slices are large, and in the latter the cost is high but the slices are small. In this paper, we prop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aspect-oriented implementation of software health indicators

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

    In the development of many software systems, the focus was on functionality. When these systems are used in situations requiring higher reliability and availability, such qualities must be retrofitted into the system. This paper considers a way of adding such capability to existing software by taking advantage of aspect-oriented programming, a recently developed technology which supports encapsula... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A run-time deadlock detector for concurrent Java programs

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

    Deadlock is one of the most serious and complex problems concerning the reliability of concurrent Java programs. In this paper, we discuss how to dynamically detect deadlocks in concurrent Java programs at run-time, and propose a representation of synchronization waiting state in an execution of a Java program, which is named the Java thread-wait-for graph. We explicitly define all types of deadlo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model checking value-passing processes

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

    An algorithm for model checking value-passing processes is presented. Processes are modeled as symbolic transition graphs with assignments. To specify properties for such processes a graphical predicate mu-calculus is introduced. It allows arbitrary nesting of the least and greatest fixpoints, and contains the propositional mu-calculus as a proper subset. The algorithm instantiates input variables... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identifying candidate objects using hierarchical clustering analysis

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

    Clustering analysis has rarely been studied as a technique for object identification methods, although it has been broadly employed in data classification in a wide range of research areas. In this paper, we propose a review of clustering analysis methods and a scheme for applying hierarchical clustering analysis to facilitate identification of candidate objects in procedural source code. The stud... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trading-assisting service discovery architecture

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

    A trading object or trader provides the ability to discover instances of services offered within a distributed system. This paper proposes a service discovery service (SDS) for a CORBA environment that can assist client providers in the construction of their client programs. By using the SDS, the client providers will obtain knowledge of services with required functionality before writing the clie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling software projects to minimize the development time and cost with a given staff

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

    A probabilistic scheduling model for software projects is presented. The model explicitly takes a scheduling strategy as input. When the scheduling strategy is fired, the model outputs a probability distribution for the project completion time or cost. By applying stochastic optimization techniques, schedules for software projects can be computed which minimize the development time or cost with a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model checking UML statecharts

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

    Unified Modeling Language (UML) has been widely used in software development. Verifying if an UML model meets the required properties has become a key issue. Model checking is an important technology of automatic formal verification to ensure the correctness of design specifications. An approach of model checking UML statecharts is given in this paper At first, the brief syntax and semantics of UM... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model checking Object-Z classes: Some experiments with FDR

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

    This paper investigates model checking Object-Z classes via their translation to the input notation of the CSP model checker FDR. Such a translation must not only be concerned with preserving the semantics of the original specification, but also with how efficiently the resulting specification can be model checked. Hence, the paper investigates alternative translation schemes and compares how effi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal verification of embedded real-time software in component-based application frameworks

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

    Producing correct software is a major goal for application frameworks that are targeted at embedded real-time systems because incorrect software is of no use and may also cause severe system damage. It is shown how formal verification can be elegantly, seamlessly, and scalably integrated into a component-based object-oriented application framework for embedded real-time systems. Two issues in such... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analyzing the CRF Java memory model

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

    The current Java memory model is flawed and has many unintended implications. As multithreaded programming becomes increasingly popular in Java and hardware memory architectures become more aggressively parallel, it is of significant importance to provide a framework for formally analyzing the Java memory model. The Murφ verification system is applied to study the commit/reconcile/fence (CRF) ... View full abstract»

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