Fable: A programming-language solution to IC process automation problems
Pages 137 - 148
Abstract
The Stanford University Center for Integrated Systems is embarking on an ambitious project to formally characterize integrated circuit fabrication processes, and to provide a degree of automation of research and prototyping activities in the IC fabrication facility. A crucial component of this project is the ability to represent an IC fabrication “recipe” in a repeatable, transportable, device-independent fashion. We have designed the language Fable for this purpose: it offers some novel approaches to abstraction and modularity. We describe the problem, explain why we were forced to devise a new language rather than use an existing language, describe important properties of the Fable language, and give several examples.
References
[1]
Brotz, Douglas. Cholla run sheet representations. Personal communication to B. Reid, May 1982.
[2]
Clare, Chris. H-P PCS run sheet files. Personal communication to B. Reid, April 1982.
[3]
Dahl, O.J. Discrete Event Simulation Languages. In Programming Languages, Genuys, F., Ed., Academic Press, 111 Fifth Avenue, New York, NY10003, 1968.
[4]
Hoare, C.A.R. Record Handling. In Programming Languages, Genuys, F., Ed., Academic Press, 111 Fifth Avenue, New York, NY10003, 1968.
[5]
IBM System/360 Operating System: PL/I (F) Language Reference Manual. IBM Data Processing Division, 1970.
[6]
J.D. Ichbiah, et al. "Preliminary Ada reference manual." SIGPLAN Notices 14, 6 (June 1979), Part A.
[7]
IIT Research Institute. APT Part Programming. McGraw-Hill, New York, 1967.
[8]
Ingalls, D.H.H. The Smalltalk-76 Programming System Design and Implementation. Xerox Palo Alto Research Center, 1976.
[9]
Jensen, K. and Wirth, N. Pascal User Manual and Report. Springer-Verlag, New York, 1974.
[10]
Lampson. B.W., et al. Report on the Programming Language Euclid. Tech. Rept. CSL-81-12, Xerox Palo Alto Research Center, October, 1981.
[11]
Liskov, B.H., Synder, A., Atkinson, R. and Schaffert, C. "Abstraction mechanisms in CLU." Comm. ACM 20, 8 (August 1977), 564-576.
[12]
Meindl, J. A Fast Turn Around Facility for Very Large Scale Integration (VLSI). Tech. Rept. FM-195-78, Stanford University IC Lab, July, 1981.
[13]
Mitchell, J.G., Maybury, W. and Sweet, R.E. Mesa language manual. Tech. Rept. CSL-79-3, Xerox Palo Alto Research Center, April, 1979.
[14]
Olesten, N.O. Numerical Control, Wiley Interscience, New York, 1970.
[15]
Sites, R.L. Algol W Reference Manual. Tech. Rept. STAN-CS-71-230, Stanford University, February, 1972.
[16]
Teitelman, W. Interlisp Reference Manual. Xerox Palo Alto Research Center, Palo Alto, California, 1978.
[17]
W.A. Wulf, R.L. Landon, and M. Shaw. "An introduction to the construction and verification of ALPHARD programs." IEEE Transactions on Software Engineering SE-2 (1976).
Index Terms
- Fable: A programming-language solution to IC process automation problems
Recommendations
Fable: A programming-language solution to IC process automation problems
SIGPLAN '83: Proceedings of the 1983 ACM SIGPLAN symposium on Programming language issues in software systemsThe Stanford University Center for Integrated Systems is embarking on an ambitious project to formally characterize integrated circuit fabrication processes, and to provide a degree of automation of research and prototyping activities in the IC ...
Fable: A Language for Enforcing User-defined Security Policies
SP '08: Proceedings of the 2008 IEEE Symposium on Security and PrivacyThis paper presents Fable, a core formalism for a programming language in which programmers may specify security policies and reason that these policies are properly enforced. In Fable, security policies can be expressed by associating security labels ...
Layout-sensitive language extensibility with SugarHaskell
Haskell '12: Proceedings of the 2012 Haskell SymposiumProgrammers need convenient syntax to write elegant and concise programs. Consequently, the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), authors of Haskell compilers provide syntactic sugar for more ...
Comments
Information & Contributors
Information
Published In
Copyright © 1983 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 June 1983
Published in SIGPLAN Volume 18, Issue 6
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations8Total Citations
- 346Total Downloads
- Downloads (Last 12 months)92
- Downloads (Last 6 weeks)27
Reflects downloads up to 17 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in