From Object-Orientation to Formal Methods Essays in Memory of Ole-Johan Dahl /

After Ole-Johan's retirement at the beginning of the new millennium, some of us had thought and talked about making a "Festschrift" in his honor. When Donald Knuth took the initiative by sending us the ?rst contribution, the p- cess began to roll! In early 2002 an editing group was fo...

Full description

Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Owe, Olaf (Editor, http://id.loc.gov/vocabulary/relators/edt), Krogdahl, Stein (Editor, http://id.loc.gov/vocabulary/relators/edt), Lyche, Tom (Editor, http://id.loc.gov/vocabulary/relators/edt)
Format: Electronic eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
Edition:1st ed. 2004.
Series:Lecture Notes in Computer Science, 2635
Subjects:
Online Access:Full Text via HEAL-Link
Table of Contents:
  • A Biography of Ole-Johan Dahl
  • A Bibliography of Ole-Johan Dahl
  • The Birth of Object Orientation: the Simula Languages
  • An Algebraic Theory of Actors and Its Application to a Simple Object-Based Language
  • Towards Posit & Prove Calculi for Requirements Engineering and Software Design
  • Distributed Concurrent Object-Oriented Software
  • Composing Hidden Information Modules over Inclusive Institutions
  • Towards the Verifying Compiler
  • Object-Oriented Specification and Open Distributed Systems
  • SIMULA and Super-Object-Oriented Programming
  • Efficient Coroutine Generation of Constrained Gray Sequences
  • Consistency of Inheritance in Object-Oriented Languages and of Static, ALGOL-like Binding
  • The Power of Abstraction, Reuse, and Simplicity: An Object-Oriented Library for Event-Driven Design
  • Iterative Synthesis of Control Guards Ensuring Invariance and Inevitability in Discrete-Decision Games
  • Incremental Reasoning for Object Oriented Systems
  • Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
  • Building Optimal Binary Search Trees from Sorted Values in O(N) Time.