000 04283nam a22004335i 4500
001 978-3-540-35757-5
003 DE-He213
005 20160624101932.0
007 cr nn 008mamaa
008 121227s1978 gw | s |||| 0|eng d
020 _a9783540357575
_9978-3-540-35757-5
024 7 _a10.1007/3-540-08921-7
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aCOM014000
_2bisacsh
082 0 4 _a004
_223
245 1 0 _aMathematical Foundations of Computer Science 1978
_h[electronic resource] :
_bProceedings, 7th Symposium Zakopane, Poland, September 4–8, 1978 /
_cedited by J. Winkowski.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1978.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1978.
300 _aIX, 556 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v64
505 0 _aThe 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.
650 0 _aComputer science.
650 1 4 _aComputer Science.
650 2 4 _aComputer Science, general.
700 1 _aWinkowski, J.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540089216
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v64
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-08921-7
942 _2EBK4182
_cEBK
999 _c33476
_d33476