No abstract available.
Algebra and models
Science makes progress by constructing mathematical models, deducing their observable consequences, and testing them by experiment. Successful theoretical models are later taken as the basis for engineering methods and codes of practice for design of ...
Using style to understand descriptions of software architecture
The software architecture of most systems is described informally and diagrammatically. In order for these descriptions to be meaningful at all, figures are understood by interpreting the boxes and lines in specific, conventionalized ways[5]. The ...
Mechanisms for generic process support
As more and more programming environments incorporate explicit process descriptions, generic process capabilities will become crucial to the convenient instantiation and maintenance of process description. However, partly because process modeling ...
Fine-grained revision control for collaborative software development
This paper presents a framework for controlling the evolution of complex software systems concurrently developed by teams of software engineers. A general technique for fine-grained revision control of hierarchically structured information, such as ...
Direct update of data flow representations for a meaning-preserving program restructuring tool
Automated assistance for meaning-preserving global restructuring is an approach for helping software engineers improve the structure of programs, thus lowering the costs of maintenance. The consturction of a restructuing tool encounters many conflicting ...
PLEIADES: an object management system for software engineering environments
Software engineering environments impose challenging requirements on the design and implementation of an object management system. Existing object management systems have been limited in both the kinds of functionality they have provided and in the ...
Towards increased productivity of algorithm implementation
This paper reports experimental results that support the feasibility of a new transformational approach developed by the authors for implementing complex algorithms correctly and efficiently. The class of algorithms amenable to our methods includes ...
A practical approach to software engineering using Z and the refinement calculus
We present a methodology for the formal specification and development of software systems using Z and the refinement calculus. The methodology combines the data structuring capabilities and the codified discrete mathematics of Z with the data ...
Deriving modular designs from formal specifications
We consider the problem of designing the top-level modular structure of an implementation. Our starting point is a formal specification of the system. Our approach is to analyse the references to the state variables by the operations of the system. ...
Targeting safety-related errors during software requirements analysis
This paper provides a Safety Checklist for use during the analysis of software requirements for spacecraft and others safety-critical, embedded systems. The checklist specifically targets the two most common causes of safety-related software errors: (1) ...
Does every inspection need a meeting?
At each step in large software development, reviewers carry out inspections to detect faults. These inspections are usually followed by a meeting to collect the faults that have been discovered. However, we have found that these inspection meetings are ...
Enhancing compositional reachability analysis with context constraints
Compositional techniques have been proposed for traditional reachability analysis in order to introduce modularity and to control the state explosion problem. While modularity has been achived, state explosion is still a problem. Indeed, this problem ...
A framework for programming and formalizing concurrent objects
We propose an object-oriented programming model based on concurrently executing communicating agents which aims to achieve reusability and extensibility of agent descriptions by separating aspects of functionality and synchronization. A formal semantics ...
A logical approach to data structures
The Galois project at the University of Texas is building a programming environment that supports the formal development and verification of data structure programs. This programming environment supports features such as pointer manipulation and ...
Test case generation by means of learning techniques
Given a program P and a set of alternative programs P, we generate a sequence of test cases that are adequate, in the sense that they distinguish the given program from all alternatives. The method is related to fault-based approaches to program testing,...
Software measure specification
This paper introduces the model-order-mapping (MOM) approach for specifying software/document measures. A MOM specification requires that the important attributes of the document be identified, a model that captures the attributes be chosen, and a ...
Partition testing, stratified sampling, and cluster analysis
We present a new approach to reducing the manual labor required to estimate software reliability. It combines the ideas of partition testing methods with those of stratified sampling to reduce the sample size necessary to estimate reliability with a ...
Signature matching: a key to reuse
Software reuse is only effective if it is easier to locate (and appropriately modify) a reusable component than to write it from scratch. We present signature matching as a method for achieving this goal by using signature information easily derived ...
Scalable software libraries
Many software libraries (e.g., the Booch C++ Components, libg++, NIHCL, COOL) provide components (classes) that implement data structures. Each component is written by hand and represents a unique combination of features (e.g. concurrency, data ...
Index Terms
- Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering
Recommendations
Acceptance Rates
Year | Submitted | Accepted | Rate |
---|---|---|---|
SIGSOFT '02/FSE-10 | 128 | 17 | 13% |
Overall | 128 | 17 | 13% |