default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7. MFCS 1978: Zakopane, Poland
- Józef Winkowski:
Mathematical Foundations of Computer Science 1978, Proceedings, 7th Symposium, Zakopane, Poland, September 4-8, 1978. Lecture Notes in Computer Science 64, Springer 1978, ISBN 0-387-08921-7
Invited Lectures
- Peter van Emde Boas:
The Connection between Modal Logic and Algorithmic Logic. 1-15 - Bruno Courcelle, Maurice Nivat:
The Algebraic Semantics of Recursive Program Schemes. 16-30 - Edsger W. Dijkstra:
Finding the Correctness Proof of a Concurrent Program. 31-38 - Vadim E. Kotov:
An Algebra for Parallelism Based on Petri Nets. 39-55 - Brian H. Mayoh:
Data Types as Functions. 56-70 - Robin Milner:
Synthesis of Communicating Behaviour. 71-83 - Eric G. Wagner, James W. Thatcher, Jesse B. Wright:
Programming Languages as Mathematical Objects. 84-101
Communications
- Mikhail Auguston:
Writing and Verifying Sequential Files Updating Programs. 102-111 - François Bancilhon:
On the Completeness of Query Languages for Relational Data Bases. 112-123 - Gerhard Barth:
Mastering Contextsensitivity in Programming Languages. 124-133 - Jan A. Bergstra:
Decision Problems Concerning Parallel Programming. 134-142 - Piotr Dembinski, Jan Maluszynski:
Attribute Grammars and Two-Level Grammars: A Unifying Approach. 143-154 - Hans-Dieter Ehrich:
Extensions and Implementations of Abstract Data Type Specifications. 155-164 - Hartmut Ehrig, Barry K. Rosen:
Concurrency of Manipulations in Multidimensional Information Structures. 165-176 - Hartmut Ehrig, Hans-Jörg Kreowski, Andrea Maggiolo-Schettini, Barry K. Rosen, Józef Winkowski:
Deriving Structures from Structures. 177-190 - Nissim Francez, C. A. R. Hoare, Willem P. de Roever:
Semantics of Nondeterminism, Concurrency and Communication (Extended Abstract). 191-200 - Georges Gardarin:
Contribution to the Theory of Concurrency in Databases. 201-212 - Hartmann J. Genrich, Kurt Lautenbach:
Facts in Place/Transition-Nets. 213-231 - Bernhard G. Goetze, Werner Nehrlich:
Loop Programs and Classes of Primitive Recursive Functions. 232-238 - Michal Grabowski, Antoni Kreczmar:
Dynamic Theories of Real and Complex Numbers. 239-249 - Dima Grigoriev:
Multiplicative Complexity of a Pair of Bilinear Forms and of the Polynomial Multiplication. 250-256 - Irène Guessarian:
Some Applications of Algebraic Semantics. 257-266 - Christopher J. Hogger:
Goal-Oriented Derivation of Logic Programs. 267-276 - Jacek Irlik:
Transforming Recursive Equations to Algorithms. 277-285 - Gérard Jacob:
Structural Invariants for Some Classes of Structured Programs. 286-297 - Ryszard Janicki:
Synthesis of Concurrent Schemes. 298-307 - Reinhard Klette
:
Fast Matrix Multiplication by Boolean RAM in Linear Storage. 308-314 - Elöd Knuth:
Cycles of Partial Orders. 315-325 - Gerhard Lischke:
Complexity Measures Defined by Mazurkiewicz-Algorithms. 326-332 - Leon Lukaszewicz:
On Functional Grammars. 333-344 - George Markowsky, Larry Carter, Mark N. Wegman:
Analysis of a Universal Class of Hash Functions. 345-354 - Otto Mayer:
A Framework for Producing Deterministic Canonical Bottom-up Parsers. 355-363 - Robert Meersman, Grzegorz Rozenberg:
Cooperating Grammar Systems. 364-373 - M. Moalla, Jacques Pulou, Joseph Sifakis:
Synchronized Petri Nets: A Model for the Description of Non-Autonomous Systems. 374-384 - Valery A. Nepomniaschy:
On Divergence and Halting Problems for Monadic Program Schemas. 385-392 - Olli Nevalainen, Matti Jakobsson, R. Berg:
Compression of Clustered Inverted Files. 393-402 - Rohit Parikh:
The Completeness of Propositional Dynamic Logic. 403-415 - Alberto Pettorossi:
Improving Memory Utilization in Transforming Recursive Programs (Extended Abstract). 416-425 - Jan Pittl:
On Two Subclasses of Real-Time Grammars. 426-435 - Zbigniew W. Ras:
On Information Storage and Retrieval Systems: An Algebraic Approach, Part I. 436-441 - Nasser Saheb-Djahromi:
Probabilistic LCF. 442-451 - Andrzej Salwicki:
On Algorithmic Theory of Stacks. 452-461 - Michael Schiffers, Horst F. Wedde:
Analyzing Program Solutions of Coordination problems by CP-Nets. 462-473 - Joseph Sifakis:
Structural Properties of Petri Nets. 474-483 - Michel Sintzoff:
Ensuring Correctness by Arbitrary Postfixed-Points. 484-492 - A. O. Slisenko:
String-Matching in Real Time: Some Properties of the Data Structure. 493-496 - Nicolas Spyratos, François Bancilhon:
Name Independence and Database Abstraction in the Relational Model. 497-505 - Peter H. Starke:
Free Petri Net Languages. 506-515 - Esko Ukkonen:
Tranformations to Produce Certain Covering Grammars. 516-525 - Rüdiger Valk:
On the Computational Power of Extended Petri Nets. 526-535 - Jorma Rissanen:
Theory of Relations for Databases - A Tutorial Survey. 536-551
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-08 20:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
