TY  - BOOK
AU  - Winkowski,J.
ED  - SpringerLink (Online service)
TI  - Mathematical Foundations of Computer Science 1978: Proceedings, 7th Symposium Zakopane, Poland, September 4–8, 1978 
T2  - Lecture Notes in Computer Science,
SN  - 9783540357575
AV  - QA75.5-76.95 
U1  - 004 23
PY  - 1978///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Computer Science
KW  - Computer Science, general
N1  - The connection between modal logic and algorithmic logics -- The algebraic semantics of recursive program schemes -- Finding the correctness proof of a concurrent program -- An algebra for parallelism based on petri nets -- Data types as functions -- Synthesis of communicating behaviour -- Programming languages as mathematical objects -- Writing and verifying sequential files updating programs -- On the completeness of query languages for relational data bases -- Mastering contextsensitivity in programming languages -- Decision problems concerning parallel programming -- Attribute grammars and two-level grammars: A unifying approach -- Extensions and implementations of abstract data type specifications -- Concurrency of manipulations in multidimensional information structures -- Deriving structures from structures -- Semantics of nondeterminism, concurrency and communication -- Contribution to the theory of concurrency in databases -- Facts in place/transition-nets -- Loop programs and classes of primitive recursive functions -- Dynamic theories of real and complex numbers -- Multiplicative complexity of a pair of bilinear forms and of the polynomial multiplication -- Some applications of algebraic semantics -- Goal-oriented derivation of logic programs -- Transforming recursion equations to algorithms -- Structural invariants for some classes of structured programs -- Synthesis of concurrent schemes -- Fast matrix multiplication by boolean RAM in linear storage -- Cycles of partial orders -- Complexity measures defined by mazurkiewicz-algorithms -- On functional grammars -- Analysis of a universal class of hash functions -- A framework for producing deterministic canonical bottom-up parsers -- Cooperating grammar systems -- Synchronized petri nets : A model for the description of non-autonomous sytems -- On divergence and halting problems for monadic program schemas -- Compression of clustered inverted files -- The completeness of propositional dynamic logic -- Improving memory utilization in transforming recursive programs -- On two subclasses of real-time grammars -- On information storage and retrieval systems an algebraic approach, part 1 -- Probabilistic LCF -- On algorithmic theory of stacks -- Analyzing program solutions of coordination problems by cp-nets -- Structural properties of petri nets -- Ensuring correctness by arbitrary postfixed-points -- String-matching in real time: Some properties of the data structure -- Name independence and database abstraction in the relational model -- Free Petri net languages -- Transformations to produce certain covering grammars -- On the computational power of extended petri nets -- Theory of relations for databases — a tutorial survey
UR  - http://dx.doi.org/10.1007/3-540-08921-7
ER  -