Mathematical Foundations of Computer Science 1978: Proceedings, 7th Symposium Zakopane, Poland, September 4–8, 1978

The connection between modal logic and algorithmic logics....Pages 1-15
The algebraic semantics of recursive program schemes....Pages 16-30
Finding the correctness proof of a concurrent program....Pages 31-38
An algebra for parallelism based on petri nets....Pages 39-55
Data types as functions....Pages 56-70
Synthesis of communicating behaviour....Pages 71-83
Programming languages as mathematical objects....Pages 84-101
Writing and verifying sequential files updating programs....Pages 102-111
On the completeness of query languages for relational data bases....Pages 112-123
Mastering contextsensitivity in programming languages....Pages 124-133
Decision problems concerning parallel programming....Pages 134-142
Attribute grammars and two-level grammars: A unifying approach....Pages 143-154
Extensions and implementations of abstract data type specifications....Pages 155-164
Concurrency of manipulations in multidimensional information structures....Pages 165-176
Deriving structures from structures....Pages 177-190
Semantics of nondeterminism, concurrency and communication....Pages 191-200
Contribution to the theory of concurrency in databases....Pages 201-212
Facts in place/transition-nets....Pages 213-231
Loop programs and classes of primitive recursive functions....Pages 232-238
Dynamic theories of real and complex numbers....Pages 239-249
Multiplicative complexity of a pair of bilinear forms and of the polynomial multiplication....Pages 250-256
Some applications of algebraic semantics....Pages 257-266
Goal-oriented derivation of logic programs....Pages 267-276
Transforming recursion equations to algorithms....Pages 277-285
Structural invariants for some classes of structured programs....Pages 286-297
Synthesis of concurrent schemes....Pages 298-307
Fast matrix multiplication by boolean RAM in linear storage....Pages 308-314
Cycles of partial orders....Pages 315-325
Complexity measures defined by mazurkiewicz-algorithms....Pages 326-332
On functional grammars....Pages 333-344
Analysis of a universal class of hash functions....Pages 345-354
A framework for producing deterministic canonical bottom-up parsers....Pages 355-363
Cooperating grammar systems....Pages 364-373
Synchronized petri nets : A model for the description of non-autonomous sytems....Pages 374-384
On divergence and halting problems for monadic program schemas....Pages 385-392
Compression of clustered inverted files....Pages 393-402
The completeness of propositional dynamic logic....Pages 403-415
Improving memory utilization in transforming recursive programs....Pages 416-425
On two subclasses of real-time grammars....Pages 426-435
On information storage and retrieval systems an algebraic approach, part 1....Pages 436-441
Probabilistic LCF....Pages 442-451
On algorithmic theory of stacks....Pages 452-461
Analyzing program solutions of coordination problems by cp-nets....Pages 462-473
Structural properties of petri nets....Pages 474-483
Ensuring correctness by arbitrary postfixed-points....Pages 484-492
String-matching in real time: Some properties of the data structure....Pages 493-496
Name independence and database abstraction in the relational model....Pages 497-505
Free Petri net languages....Pages 506-515
Transformations to produce certain covering grammars....Pages 516-525
On the computational power of extended petri nets....Pages 526-535
Theory of relations for databases — a tutorial survey....Pages 536-551