Sciweavers

KBSE
1997
IEEE
13 years 8 months ago
Exploiting Domain-Specific Knowledge to Refine Simulation Specifications
This paper discusses our approach to the problem of refining high-level simulation specifications. Our domain is simulated combat training for tank platoon members. Our input is a...
David Pautler, Steven Woods, Alex Quilici
KBSE
1997
IEEE
13 years 8 months ago
A Structured Approach for Synthesizing Planners from Specifications
Biplav Srivastava, Subbarao Kambhampati, Amol Datt...
KBSE
1997
IEEE
13 years 8 months ago
NORA/HAMMR: Making Deduction-Based Software Component Retrieval Practical
Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This...
Johann Schumann, Bernd Fischer 0002
KBSE
1997
IEEE
13 years 8 months ago
Applying Concept Formation Methods to Object Identification in Procedural Code
Legacy software systems present a high level of entropy combined with imprecise documentation. This makes their maintenance more difficult, more time consuming, and costlier. In o...
Houari A. Sahraoui, Walcélio L. Melo, Hakim...
KBSE
1997
IEEE
13 years 8 months ago
Declarative Specification of Software Architectures
John Penix, Perry Alexander, Klaus Havelund
KBSE
1997
IEEE
13 years 8 months ago
Genetic Algorithms for Dynamic Test Data Generation
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...
Christoph C. Michael, Gary McGraw, Michael Schatz,...
KBSE
1997
IEEE
13 years 8 months ago
Distributed Cooperative Formal Methods Tools
Abstract: This paper describes some tools to support formal methods, and conversely some formal methods for developing such tools. We focus on distributed cooperative proving over ...
Joseph A. Goguen, Kai Lin, A. Mori, Grigore Rosu, ...
KBSE
1997
IEEE
13 years 8 months ago
A Metric-based Approach to Detect Abstract Data Types and State Encapsulations
Jean-Francois Girard, Rainer Koschke, Georg Schied
KBSE
1997
IEEE
13 years 8 months ago
A Formal Automated Approach for Reverse Engineering Programs with Pointers
Given a program S and a precondition Q, the strongest postcondition, denoted sp(S Q), is defined as the strongest condition that holds after the execution of S, given that S term...
Gerald C. Gannod, Betty H. C. Cheng