By Topic

IEEE Transactions on Software Engineering

Issue 9 • Date Sep 1990

Filter Results

Displaying Results 1 - 11 of 11
  • Using Larch to specify Avalon/C++ objects

    Publication Year: 1990, Page(s):1076 - 1088
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1084 KB)

    A formal specification of three base Avalon/C++ classes recoverable, atomic, and subatomic - is given. Programmers derive from class recoverable to define persistent objects, and from either class atomic or class subatomic to define atomic objects. The specifications, written in Larch, provide the means for showing that classes derived from the base classes implement objects that are persistent or... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal verification of Ada programs

    Publication Year: 1990, Page(s):1058 - 1075
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1588 KB)

    The Penelope verification editor and its formal basis are described. Penelope is a prototype system for the interactive development and verification of programs that are written in a rich subset of sequential Ada. Because it generates verification conditions incrementally, Penelope can be used to develop a program and its correctness proof in concert. If an already-verified program is modified, on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Debugging Larch shared language specifications

    Publication Year: 1990, Page(s):1044 - 1057
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1176 KB)

    The checkability designed into the LSL (Larch shared language) is described, and two tools that help perform the checking are discussed. LP (the Larch power) is the principal debugging tool. Its design and development have been motivated primarily by work on LSL, but it also has other uses (e.g. reasoning about circuits and concurrent algorithms). Because of these other uses, and because they also... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A formal model of program dependences and its implications for software testing, debugging, and maintenance

    Publication Year: 1990, Page(s):965 - 979
    Cited by:  Papers (104)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1480 KB)

    A formal, general model of program dependences is presented and used to evaluate several dependence-based software testing, debugging, and maintenance techniques. Two generalizations of control and data flow dependence, called weak and strong syntactic dependence, are introduced and related to a concept called semantic dependence. Semantic dependence models the ability of a program statement to af... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • KIDS: a semiautomatic program development system

    Publication Year: 1990, Page(s):1024 - 1043
    Cited by:  Papers (137)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1584 KB)

    The Kestrel Interactive Development System (KIDS), which provides automated support for the development of correct and efficient programs from formal specifications, is described. The system has components for performing algorithm design, deductive inference, program simplification, partial evaluation, finite differencing optimizations, data type refinement, compilation, and other development oper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The specification and verified decomposition of system requirements using CSP

    Publication Year: 1990, Page(s):932 - 948
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1376 KB)

    A formal method for decomposing the critical requirements of a system into requirements of its component processes and a minimal, possibly empty, set of synchronization requirements is described. The trace model of Hoare's communicating sequential processes (CSP) is the basis for the formal method. The method is applied to an abstract voice transmitter and describes the role that the EHDM verifica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal specification of a look manager

    Publication Year: 1990, Page(s):1089 - 1103
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1104 KB)

    A formal specification of the look manager of a dialog system is presented. The look manager deals with the presentation of visual aspects of objects and the editing of those visual aspects. A formal model for specifying the look of objects based on the notion of texturing objects is presented. The texturing model is built from the observed real-life use of overlays of slides. The specification ta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate reasoning about the semantic effects of program changes

    Publication Year: 1990, Page(s):980 - 992
    Cited by:  Papers (18)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1060 KB)

    It is pointed out that the incremental cost of a change to a program is often disproportionately high because of inadequate means of determining the semantic effects of the change. A practical logical technique for finding the semantic effects of changes through a direct analysis of the program is presented. The programming language features considered include parametrized modules, procedures, and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specification and verification using dependent types

    Publication Year: 1990, Page(s):949 - 964
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1276 KB)

    VERITAS+, a specification logic based on dependent types, is described. The overall aim is to demonstrate how the use of dependent types together with subtypes and datatypes allows the writing of specifications that are clear, concise, and generic. The development of theories of arithmetic, numerals, and iterative structures is described, and the proof of a theorem that greatly simplifi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mechanizing CSP trace theory in higher order logic

    Publication Year: 1990, Page(s):993 - 1004
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1084 KB)

    How a mechanized tool for reasoning about CSP (communicating sequential processes) can be developed by customizing an existing general-purpose theorem prover based on higher-order logic is described. How the trace semantics of CSP operators can be mechanized in higher-order logic is investigated, and how the laws associated with these operators can be proved from their semantic definitions is show... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mechanically verifying concurrent programs with the Boyer-Moore prover

    Publication Year: 1990, Page(s):1005 - 1023
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1424 KB)

    A proof system suitable for the mechanical verification of concurrent programs is described. This proof system is based on Unity, and may be used to specify and verify both safety and liveness properties. However, it is defined with respect to an operational semantics of the transition system model of concurrency. Proof rules are simply theorems of this operational semantics. This methodology make... View full abstract»

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

Aims & Scope

The IEEE Transactions on Software Engineering is interested in well-defined theoretical results and empirical studies that have potential impact on the construction, analysis, or management of software. The scope of this Transactions ranges from the mechanisms through the development of principles to the application of those principles to specific environments. Specific topic areas include: a) development and maintenance methods and models, e.g., techniques and principles for the specification, design, and implementation of software systems, including notations and process models; b) assessment methods, e.g., software tests and validation, reliability models, test and diagnosis procedures, software redundancy and design for error control, and the measurements and evaluation of various aspects of the process and product; c) software project management, e.g., productivity factors, cost models, schedule and organizational issues, standards; d) tools and environments, e.g., specific tools, integrated tool environments including the associated architectures, databases, and parallel and distributed processing issues; e) system issues, e.g., hardware-software trade-off; and f) state-of-the-art surveys that provide a synthesis and comprehensive review of the historical development of one particular area of interest.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Matthew B. Dwyer
Dept. Computer Science and Engineering
256 Avery Hall
University of Nebraska-Lincoln
Lincoln, NE 68588-0115 USA
tse-eic@computer.org