Umfang:
Online-Ressource (IX, 551 S.)
Ausgabe:
Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
ISBN:
9783540357575
Serie:
Lecture notes in computer science 64
Inhalt:
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.
Anmerkung:
Literaturangaben
Weitere Ausg.:
ISBN 3540089217
Weitere Ausg.:
ISBN 0387089217
Weitere Ausg.:
ISBN 9783540089216
Weitere Ausg.:
Erscheint auch als Druck-Ausgabe Mathematical foundations of computer science 1978 Berlin [u.a.] : Springer, 1978 ISBN 3540089217
Weitere Ausg.:
ISBN 0387089217
Sprache:
Englisch
Fachgebiete:
Informatik
Schlagwort(e):
Konferenzschrift
DOI:
10.1007/3-540-08921-7
URL:
Volltext
(lizenzpflichtig)
Bookmarklink
