Vai al contenuto principale della pagina

Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : Seventh Conference, Pune, India, December 17-19, 1987. Proceedings / / edited by Kesav V. Nori



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Titolo: Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : Seventh Conference, Pune, India, December 17-19, 1987. Proceedings / / edited by Kesav V. Nori Visualizza cluster
Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987
Edizione: 1st ed. 1987.
Descrizione fisica: 1 online resource (IX, 541 p.)
Disciplina: 005.1
Soggetto topico: Software engineering
Architecture, Computer
Computer programming
Algorithms
Computers
Software Engineering/Programming and Operating Systems
Computer System Implementation
Software Engineering
Programming Techniques
Algorithm Analysis and Problem Complexity
Computation by Abstract Devices
Persona (resp. second.): NoriKesav V
Note generali: Bibliographic Level Mode of Issuance: Monograph
Nota di contenuto: 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.
Titolo autorizzato: Foundations of software technology and theoretical computer science  Visualizza cluster
ISBN: 3-540-48033-1
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 996465810403316
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Serie: Lecture Notes in Computer Science, . 0302-9743 ; ; 287