Publications 1980-1990

 

7 Publications 1980-1990

[Old90]

E.-R. Olderog. From trace specifications to process terms. In J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, volume 430 of Lecture Notes in Computer Science, pages 592-621. Springer-Verlag, 1990.
[ bib ]

[MO90]

J.-J. Ch. Meyer and E.-R. Olderog. Hiding in stream semantics of uniform concurrency. Acta Informatica, 27:381-397, 1990.
[ bib ]

[AdO90]

K. R. Apt, F. S. de Boer, and E.-R. Olderog. Proving termination of parallel programs. In W. H. J. Feijen, A. J. M. van Gasteren, D. Gries, and J. Misra, editors, Beauty is our Business - A Birthday Salute to Edsger W. Dijkstra. Springer-Verlag, 1990.
[ bib ]

[BHB⁺89]

D. Bjørner, C. A. R. Hoare, J. P. Bowen, He Jifeng, H. Langmaack, E.-R. Olderog, U. H. Martin, V. Stavridou, F. Nielson, H. R. Nielson, H. Barringer, D. Edwards, H. H. Løvengreen, A. P. Ravn, and H. S. Rischel. A ProCoS project description. Bulletin of the European Association for Theoretical Computer Science (EATCS), 39:60-73, October 1989.
[ bib ]

[dMOZ88]

J. W. de Bakker, J.-J. Ch. Meyer, E.-R. Olderog, and J. I. Zucker. Transition systems, metric spaces and ready sets in the semantics of uniform concurrency. Journal of Computer and System Sciences, 36:158-224, 1988.
[ bib ]

[BKO88]

J. A. Bergstra, J. W. Klop, and E.-R. Olderog. Readies and failures in the algebra of communicating processes. SIAM J. Comput., 17:1134-1177, 1988.
[ bib ]

[OA88]

E.-R. Olderog and K. R. Apt. Fairness in parallel programs: the transformational approach. ACM TOPLAS, 10:420-455, 1988.
[ bib ]

[dBMO87]

J. W. de Bakker, J.-J. Ch. Meyer, and E.-R. Olderog. Infinite streams and finite observations in the semantics of uniform concurrence. Theoret. Comput. Sci., 49:87-112, 1987.
[ bib ]

[BKO87]

J.A. Bergstra, J.W. Klop, and E.-R. Olderog. Failures without chaos: a process semantics for fair abstraction. In M. Wirsing, editor, Formal Description of Programming Concepts - III, Lecture Notes in Computer Science, pages 77-101, Amsterdam, 1987. North-Holland.
[ bib ]

[OH86]

E.-R. Olderog and C. A. R. Hoare. Specification-oriented semantics for communicating processes. Acta Informatica, 23:9-66, 1986.
[ bib ]

[dBMOZ85]

J.W. de Bakker, J.-J. Ch. Meyer, E.-R. Olderog, and J.I. Zucker. Transition systems, infinitary languages and the semantics of uniform concurrency. In Proc. 17th ACM Symp. on Theory of Computing, pages 252-262. ACM Press, 1985. Providence, R.I.
[ bib ]

[Old84b]

E.-R. Olderog. Hoare's logic for programs with procedures-what has been achieved? In E.M. Clarke and D. Kozen, editors, Proc. Logics of Programs, volume 164 of Lecture Notes in Computer Science, pages 383-395. Springer, 1984.
[ bib ]

[Old84a]

E.-R. Olderog. Correctness of programs with Pascal-like procedures without global variables. Theoretical Computer Science, 30:49-90, 1984.
[ bib ]

[Old83a]

E.-R. Olderog. A characterization of Hoare's logic for programs with Pascal-like procedures. In Proc. 15th ACM Symp. on Theory of Computing, pages 320-329. ACM Press, April 1983. Boston, Mass.
[ bib ]

[AO83]

K.R. Apt and E.-R. Olderog. Proof rules and transformations dealing with fairness. Science of Computer Programming, 3:65-100, 1983.
[ bib ]

[Old83b]

E.-R. Olderog. On the notion of expressiveness and the rule of adaptation. Theoretical Computer Science, 24:337-347, 1983.
[ bib ]

[Old81]

E.-R. Olderog. Sound and complete Hoare-like calculi based on copy rules. Acta Informatica, 16:161-197, 1981.
[ bib ]

[LO80]

H. Langmaack and E.-R. Olderog. Present-day Hoare-like systems for programming languages with procedures: power, limits and most likely extensions. In J.W. de Bakker and J. van Leeuwen, editors, Automata, Languages and Programming (Proc. 7th ICALP), volume 85 of Lecture Notes in Computer Science, pages 363-373. Springer, 1980.
[ bib ]