Donald I. Good  Home/Search
Context Related
| utexas.edu/pub/boyer/icsr...cmp31.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: utexas.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: One of the main reasons why constructing deductive proofs that programs satisfy their specifications can be very expensive in practice is the absence of reusable problem domain theories. These theories contain functions that define relevant concepts in the application area of the program, and they contain properties that are deduced from these definitions. Presently, the cost of proving programs is highly inflated by the fact that we usually have to build a new problem domain theory for each... (Update)
Context of citations to this paper: More
.... function suites or monads in functional language programming systems [24] whole theories or theory extensions in theorem proving systems [5]; object classes in OOP systems; and whole specifications in formal software development environments [27] This paper is concerned with...
Cited by: More
Specification-based Retrieval Strategies for Module Reuse - Hemer, Lindsay (1999) (Correct)
Active bibliography (related documents): More All
0.8: Foundations of a Theory of Specification for Distributed Systems - Stark (1984) (Correct)
0.3: Verification Of The Stenning Protocol - DiVito (Correct)
0.2: A Formal Semantics for Evaluating Cryptographic Protocols - Yasinsac (1996) (Correct)
Similar documents based on text: More All
0.0: Dodecagonal Tilings as Maximal Cluster Coverings - Gähler, Lück, Ben-Abraham.. (2000) (Correct)
0.0: The Inflation of Nonautonomous Systems and Their Pullback.. - Kloeden, Kozyakin (2000) (Correct)
0.0: The Inflation of Attractors and Their Discretization: The.. - Kloeden, Kozyakin (2000) (Correct)
BibTeX entry: (Update)
D. Good. Reusable problem domain theories. Technical Report 31, ICSCA, University of Texas at Austin, 1982. http://citeseer.ist.psu.edu/good82reusable.html More
@misc{ good82reusable,
author = "D. Good",
title = "Reusable problem domain theories",
text = "D. Good. Reusable problem domain theories. Technical Report 31, ICSCA,
University of Texas at Austin, 1982.",
year = "1982",
url = "citeseer.ist.psu.edu/good82reusable.html" }
Citations (may not include all citations):392 A Computational Logic (context) - Boyer, Moore - 1979
77 Pascal User Manual and Report (context) - Jensen, Wirth - 1974
31 Report on the Programming Language Euclid (context) - Lampson, Horning et al. - 1976
18 An Overview of AFFIRM: A Specification and Verification Syst.. (context) - Gerhart, Musser et al. - 1980
5 Certifiable Minicomputer Project (context) - Good, Cohen et al. - 1978
3 Verification of Communications Protocols and Abstract Proces.. (context) - DiVito - 1982
2 The Proof of a Distributed System in Gypsy (context) - Good - 1982
1 REUSABLE PROBLEM DOMAIN THEORIES (context) - McCarthy, Abrahams et al. - 1962
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.utexas.edu.html): More
Stack Tracing In A Statically Typed Language - Diwan (1991) (Correct)
Combining Top-down and Bottom-up Techniques in Inductive .. - Zelle, Mooney, Konvisser (1994) (Correct)
Expert Systems for Monitoring and Control - Dvorak (1987) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC