Mathematical foundations of computer science, 1980 : proceedings of the 9th symposium held in Rydzyna, Poland, September 1-5, 1980

Gespeichert in:
Bibliographische Detailangaben
Körperschaft: Symposium on mathematical foundations of computer science :Rydzyna, Pologne
Weitere Verfasser: Dembiński, Piotr (Verlagsleitung)
Format: Livre numérique
Sprache:Anglais
Veröffentlicht: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Schriftenreihe:Lecture notes in computer science 88
Schlagworte:
Online Zugang:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Anmerkung: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Mathematical foundations of computer science, 1980, proceedings of the 9th symposium held in Rydzyna, Poland, September 1-5, 1980, edited by P. Dembiński, Berlin, Springer-Verlag, 1980, 1 vol. (VIII-723 p.), Lecture notes in computer science, 3-540-10027-X
• Mathematical Foundations of Computer Science 1980, Texte imprimé, 9783662163672
LEADER 05414nam a22003857a 4500
001 943919
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155168401
020 |a 9783540381945 (PDF) 
041 0 |a eng 
082 |a 004 
111 2 |a Symposium on mathematical foundations of computer science  |n (09  |d  :1980  |c  :Rydzyna, Pologne). 
245 1 0 |a Mathematical foundations of computer science, 1980 :  |b proceedings of the 9th symposium held in Rydzyna, Poland, September 1-5, 1980   |c edited by P. Dembiński. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 88  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a Formal description of programming concepts -- Electronic category theory -- An essay about research on sparse NP complete sets -- Some theoretical aspects of applicative multiprocessing -- On some discrete optimization problems in mass storage systems -- Abstract data types: A retrospective and prospective view -- Controlling behaviours of systems : Some basic concepts and some applications -- Conceptual relations between databases transformed under join and projection -- The weighted Sperner's Set problem -- Proof of a concurrent program finding Euler paths -- A theoretical basis for the systematic proof method -- Consistent semantics for a data flow language -- Analog processes -- An extended polymorphic type system for applicative languages -- A criterion of undecidability of algorithmic theories -- On finding the optimal access path to resolve a relational data base query -- Compound algebraic implementations: An approach to stepwise refinement of software systems -- On and/or schemes -- A term model for CCS -- A mathematical approach to multi-pass parsing -- Abstract implementation of abstract data types -- Parallel algorithms in graph theory: Planarity testing (preliminary version) -- On atomic nets and concurrency relations -- Node-label controlled graph grammars (Extended abstract) -- A method to compare the descriptive power of different types of Petrinets -- A simple class of algorithmic specifications for abstract software modules -- Inducing patterns of behaviour in distributed system parts -- Van wijngaarden grammars as a special information processing model -- Approaches to concurrency in B-trees -- On a subclass of pseudopolynomial problems -- Decidability of reachability in persistent vector replacement systems -- Generalized heapsort -- Decidability results on a query language for data bases with incomplete information -- New results on completeness and consistency of abstract data types -- Asymptotic complexity of game-searching procedures -- Completeness in classical logic of complex algorithms -- Initially Restricting algebraic theories -- Schemes for nonsequential processing systems -- Dynamic algebras which are not Kripke structures -- Time and space bounds in producing certain partial orders -- Axioms of algorithmic logic univocally determine semantics of programs -- A logical approach to the problem P=NP? -- Verifying concurrent system specifications in COSY -- Deadlocks and livelocks in transition systems -- Descriptional complexity of concurrent processes (preliminary version) -- A uniform approach to applicative and imperative features in programming languages -- A resource allocation problem -- An 0(n 2 lognloglogn) expected time algorithm for the all shortest distance problem -- Decision complexity of variants of propositional dynamic logic -- Relativized obliviousness -- Abstract data types as lattices of finitely generated models -- The LR(k) parser -- Substitution systems A family of system models based on concurrency. 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
650 |a Informatique 
650 |a Automates mathématiques, Théorie des 
650 |a Ordinateurs 
650 |a Logique symbolique et mathématique 
650 |a Actes de congrès 
700 1 |a Dembiński, Piotr.  |4 pbd 
776 0 |0 022807683  |t Mathematical foundations of computer science, 1980  |o proceedings of the 9th symposium held in Rydzyna, Poland, September 1-5, 1980  |f edited by P. Dembiński  |c Berlin  |n Springer-Verlag  |d 1980  |p 1 vol. (VIII-723 p.)  |s Lecture notes in computer science  |z 3-540-10027-X 
776 0 |t Mathematical Foundations of Computer Science 1980  |b Texte imprimé  |z 9783662163672 
856 4 |q PDF  |u https://doi.org/10.1007/BFb0022491  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-K8BLR7HF-1  |z Accès sur la plateforme Istex 
856 4 |5 452349901:74792452X  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/BFb0022491  |z Accès Université d'Orléans 
856 4 |5 180339901:750936681  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/BFb0022491  |z Accès INSA CVL 
997 |0 943919  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/