Foundations of software technology and theoretical computer science : seventh conference, Pune, India, December 17 19, 1987 : proceedings : FST and TCS 7

Zapisane w:
Opis bibliograficzny
Korporacja: Conference on foundations of software technology and theoretical computer science :Pune
Kolejni autorzy: Nori, Kesav V., 1945- (Dyrektor wydawnictwa)
Format: Livre numérique
Język:Anglais
Wydane: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Seria:Lecture notes in computer science 287
Hasła przedmiotowe:
Dostęp online:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Komentarz: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Foundations of software technology and theoretical computer science, proceedings, FST and TCS 7, seventh conference, Pune, India, December 17-19, 1987 ; ed. Kesav V. Nori, Kesav V. Nori, Berlin, Springer, 1987, 1 vol. (IX-539 p.), Lecture notes in computer science, 3-540-18625-5
• Foundations of Software Technology and Theoretical Computer Science, Texte imprimé, 9783662215203
LEADER 04680nam a22004097a 4500
001 943885
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155167375
020 |a 9783540480334 (PDF) 
041 0 |a eng 
082 |a 004 
111 2 |a Conference on foundations of software technology and theoretical computer science  |n (07  |d  :1987  |c  :Pune). 
245 1 0 |a Foundations of software technology and theoretical computer science :  |b seventh conference, Pune, India, December 17 19, 1987 : proceedings : FST and TCS 7   |c [edited by] Kesav V. Nori. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 287  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a Algebraic operational semantics -- On ambiguity of DTOL systems -- The equivalence problem for n-tape finite automata with simple cycles -- Relating the degree of ambiguity of finite automata to the succinctness of their representation -- Automata, games, and positive monadic theories of trees -- An algorithm for colouring perfect planar graphs -- Efficient algorithms for domination and Hamilton circuit problems on permutation graphs -- Fast parallel algorithms for the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs -- Improved bounds for covering general polygons with rectangles -- Submodule construction as equation solving in CCS -- Computations in undistinguished networks -- A distributed algorithm to implement n-party rendezvous -- Merge and termination in process algebra -- Parallelism and programming: A perspective -- On optimal parallelization of sorting networks -- Parallel algorithms for approximate edge colouring of simple graphs -- An optimal randomized routing algorithm for the Mesh and a class of efficient Mesh-like routing networks -- An O(n2) algorithm for fan-out free query optimization -- Weak consistency of read-only transactions: A tool to improve concurrency in heterogeneous locking protocols -- Optimizing join queries in distributed databases -- Reasoning in systems of equations and inequations -- Specification=program+types -- Paraconsistent logic programming -- Semantics of distributed Horn clause programs -- The calculus of constructions : State of the art -- Modules for re-use -- Hierarchical refinement of A Z specification -- Lazy pattern matching in the ML language -- Program development using lambda abstraction -- Relativized Arthur-Merlin versus Merlin-Arthur games -- Probabilistic quantifiers vs. distrustful adversaries -- On certain bandwidth restricted versions of the satisfiability problem of propositional CNF formulas -- A look-ahead interpreter for sequential Prolog and its implementation -- Extension of weakest precondition formalism to a low level language -- Retrospection on the PQCC compiler structure -- Some recent applications of knowledge. 
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 Génie logiciel 
650 |a Informatique 
650 |a Algorithmes 
650 |a Ordinateurs 
650 |a Intelligence artificielle 
650 |a Logiciels 
650 |a Actes de congrès 
700 1 |a Nori, Kesav V.,  |d 1945-  |4 pbd 
776 0 |0 020518781  |t Foundations of software technology and theoretical computer science  |o proceedings  |o FST and TCS 7, seventh conference, Pune, India, December 17-19, 1987 ; ed. Kesav V. Nori  |f Kesav V. Nori  |c Berlin  |n Springer  |d 1987  |p 1 vol. (IX-539 p.)  |s Lecture notes in computer science  |z 3-540-18625-5 
776 0 |t Foundations of Software Technology and Theoretical Computer Science  |b Texte imprimé  |z 9783662215203 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-18625-5  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-J9LSQ8JQ-Q  |z Accès sur la plateforme Istex 
856 4 |5 452349901:747924805  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-18625-5  |z Accès Université d'Orléans 
856 4 |5 180339901:750936959  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-18625-5  |z Accès INSA CVL 
997 |0 943885  |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/