Writing Larch interface language specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the algebraic definition of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Report on the Larch shared language
Science of Computer Programming
A Larch shared language handbook
Science of Computer Programming
On the implementation of abstract data types by programming language constructs
Journal of Computer and System Sciences
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
Abstract data types and software validation
Communications of the ACM
Formal specification as a design tool
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Semantics of CLEAR, A Specification Language
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
The specification and application to programming of abstract data types.
The specification and application to programming of abstract data types.
Design of a text formatter with AUTO STAR
ACM SIGAda Ada Letters
Computational reflection in PowerEpsilon
ACM SIGPLAN Notices
Program transformation in constructive type theory
ACM SIGPLAN Notices
A provably correct operating system: &dgr;-core
ACM SIGOPS Operating Systems Review
The minimal model of operating systems
ACM SIGOPS Operating Systems Review
Formal specifications of debuggers
ACM SIGPLAN Notices
A formal semantic definition of DEVIL
ACM SIGPLAN Notices
Partitioning based operating system: a formal model
ACM SIGOPS Operating Systems Review
| Hi-index | 0.00 |
This report summarizes the AUTO STAR project. AUTO STAR is a software development system which accepts the algebraic specification of a given software system and produces an Ada implementation of that system."In many applications, algorithms play almost no role, and certainly present almost no problem. The real problem is the mass of detailed requirements; and the only solution is the discovery or invention of general rules and abstractions which cover the many thousands of cases with as few exceptions as possible. This is what makes a program short, simple, and reliable, as compared with one which attempts to treat every case as a special case. But the discovery of such general rules and classifications demands at least the same inventive genius as that of a classificatory biologist, or the grammarian of a natural language, or even a theoretical physicist".