Abstract
The utility of directly executing formal specifications is briefly touched upon and the concept of exhaustive search as a means of execution is introduced. A mechanism for improving the efficiency of such searches is presented in some detail. Finally, the results of an implementation of the mechanism are presented.
This research was sponsored in part by a Research Initiation Award from the National Science Foundation (NSF), under grant CCR-9308726, by a grant from the TRW Corporation, and by the Wright Laboratory, Aeronautical Systems Center, Air Force Materiel Command, USAF, and the Advanced Research Projects Agency (ARPA), under grant F33615-93-1-1330.
Chapter PDF
Similar content being viewed by others
Keywords
References
A. Aho, R. Sethi and J. Ulman, Compilers Principles, Techniques and Tools, Addison Wesley 1986.
N. E. Fuchs. Specifications are (preferably) executable. Software Engineering Journal, 1992, 7, (5), pp 323–334.
I. J. Hayes and C. B. Jones, Specifications are not (necessarily) executable, Software Engineering Journal, 1989, 4, (6), pp 330–338.
D. Jackson and C. A. Damon. Semi-Executable Specifications, Technical Report CMU-CS-95-216, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1995.
D. Jackson, Nitpick: A Checkable Specification Language, Workshop of Formal Methods in Software Practice (FMSP '96), San Diego, 1996.
D. Jackson and C. A. Damon. Elements of Style: Analyzing a Software Design Feature with a Counterexample Detector. Proc. ISSTA 96, San Diego, CA, 1996.
D. Jackson, S. Jha and C. Damon. Faster Checking of Software Specifications by Eliminating Isomorphs. Proc. Principles of Programming St. Petersburg, Florida, USA, 1996.
L. Kanal and V. Kumar, Ed. Search in Artificial Intelligence, Springer-Verlag, New York, 1988.
N. M. Sadeh and M. S. Fox. Variable and Value ordering Heuristics for Hard Constraint Satisfaction Problems: An Application to Job Shop Scheduling, Technical Report CMU-RI-TR-91-23, Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, 1991.
J. K. Slaney. Finder: Finite Domain Enumerator, System Description. Proc. 12th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence series, Springer Verlag, Berlin, 1994, pp. 798–801.
J. M. Spivey, The Z Notation: A Reference Manual, Prentice-Hall International, 1989.
S. H. Valentine. Z-, an executable subset of Z. In J. E. Nicholls (ed.), Z User Workshop, York, 1991. Springer-Verlag Workshops in Computing 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Damon, C.A., Jackson, D. (1996). Efficient search as a means of executing specifications. In: Margaria, T., Steffen, B. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 1996. Lecture Notes in Computer Science, vol 1055. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61042-1_39
Download citation
DOI: https://doi.org/10.1007/3-540-61042-1_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61042-7
Online ISBN: 978-3-540-49874-2
eBook Packages: Springer Book Archive