ACM Home Page
Please provide us with feedback. Feedback
Faster checking of software specifications by eliminating isomorphs
Full text PdfPdf (1.11 MB)
Source Annual Symposium on Principles of Programming Languages archive
Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents
St. Petersburg Beach, Florida, United States
Pages: 79 - 90  
Year of Publication: 1996
ISBN:0-89791-769-3
Authors
Daniel Jackson  School of Computer Science, Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA
Somesh Jha  School of Computer Science, Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA
Craig A. Damon  School of Computer Science, Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 20,   Citation Count: 8
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/237721.237733
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
B+94
 
BC+92
 
BG94
J. Bowen and M,J.C. Gordon. Z and HOL. Z User Workshop, Cambridge, England, 1994, Springer- Verlag Workshops in Computing, pp. 141-167.
 
BH94
Rudolf Berghammer and Claudia Hattensperger. Computer-Aided Manipulation of Relational Expressions and Formulae Using RALF. Technical Report, Institut fur Informatik und Praknsche Mathematik, Chrisnan-Albrechts Universitat Zu Kiel, Kiel, Germany, 1994.
 
BS92
 
CFJ93
DK94
ELL94
 
ES93
 
ES94
Marcm EngeI and Jens Ulrlk Skakkebaek. Applying PVS to Z. Techmcal Report ID/DTU ME 3/1, ProCos Project, Department of Computer Science, Technical University of Denmark, Lyngby, Denmark.
 
GGH90
 
Hay93
 
Hol91
 
ID93
 
Jac94
 
Jac96
Daniel Jackson. Nitplck: A Checkable Specification Language. Proc.Workshop on Formal Methods m Software Practice, San Diego, CA, January 1996.
JD96
 
Jon92
R.B. Jones. ICL ProofPower. British Computer Society Formal Aspects of Computer Sctence, Series 3, 1(1), 1992, pp. 10-13.
 
Kur86
R.E Kurshan. Testing Containment of Omega- Regular Languages. AT&T Bell Laboratories, Techmcal Report 1121-861010-33 (1986).
 
Kur94
 
LL91
 
McK81
Brendan D. McKay. Practical graph isomorphism. Congressus Numerantium 21 (1981), pp. 499-517.
 
McK94a
Brendan D. McKay. Nauty User's Guide, version 1.5. Computer Science Department, Austrahan National University, GPO Box 4, ACT 2601, Austraha.
 
McK94b
Brendan D. McKay. Isomorph-free exhaustive generatzon. Unpubhshed manuscript. Computer Science Department, Austrahan National Unlversity, GPO Box 4, ACT 2601, Australia.
 
Sla94
 
Spi92
 
SS93
Gunther Schmldt and Thomas Strohlein. Relations and Graphs. EATCS Monographs in TheorencaI Computer Science, Springer-Verlag, t993.
 
Sta91
 
Val91
 
WO80
E.J. Weyuker and T.J. Ostrand. Theories of program testing and the apphcanon of reveahng subdomains. IEEE Trans. on Software Engineering, vol. SE-6, pp. 236-24S, May 1980.

CITED BY  8

Collaborative Colleagues:
Daniel Jackson: colleagues
Somesh Jha: colleagues
Craig A. Damon: colleagues