Mathematical Foundations of Computer Science 1978
Springer Berlin (Verlag)
978-3-540-08921-6 (ISBN)
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.
| Erscheint lt. Verlag | 1.8.1978 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | IX, 556 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 909 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge |
| Informatik ► Theorie / Studium ► Compilerbau | |
| Schlagworte | algorithms • Calculus • Complexity • Computer • Computer Science • Database • Datenbank • Informatik • Logic • Programmiersprache • Programmierung (EDV) • programming • Programming language • Simultanarbeit (EDV) • Text |
| ISBN-10 | 3-540-08921-7 / 3540089217 |
| ISBN-13 | 978-3-540-08921-6 / 9783540089216 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
