Amazon cover image
Image from Amazon.com

Foundations of software technology and theoretical computer science : 15th conference, Bangalore, India, December 18-20, 1995 : proceedings / P.S. Thiagarajan (ed.).

Contributor(s): Thiagarajan, P. SMaterial type: TextTextSeries: Serienbezeichnung | Lecture notes in computer science ; 1026.Publication details: Berlin ; New York : Springer, ©1995. Description: 1 online resource (xii, 513 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540492634; 3540492631Subject(s): Computer software -- Congresses | Computer science -- Congresses | Computer science | Computer software | Informatica | ProgrammatuurtechniekGenre/Form: Electronic books. | Conference papers and proceedings. | Congressen (vorm) Additional physical formats: Print version:: No titleDDC classification: 004/.01/51 LOC classification: QA76.751 | .F692 1995Other classification: 54.52 | 54.50 | 54.10 Online resources: Click here to access online
Contents:
Looking for MUM and DAD: Text-text comparisons do help -- Branch and bound on the network model -- A near optimal algorithm for the extended cow-path problem in the presence of relative errors -- Efficient algorithms for vertex arboricity of planar graphs -- A condition for the three colourability of planar locally path graphs -- A framework for the specification of reactive and concurrent systems in Z -- Synthesizing different development paradigms: Combining top-down with bottom-up reasoning about distributed systems -- Verifying part of the ACCESS.bus protocol using PVS -- Reusing batch parsers as incremental parsers -- The expressive power of indeterminate primitives in asynchronous computation -- The transformation calculus -- Equational axiomatization of bicoercibility for polymorphic types -- From causal consistency to sequential consistency in shared memory systems -- Observation of software for distributed systems with RCL -- Partiality and approximation schemes for local consistency in networks of constraints -- Maximal extensions of simplification orderings -- Average polynomial time is hard for exponential time under sn-reductions -- On self-testing without the generator bottleneck -- Observing behaviour categorically -- An algorithm for reducing binary branchings -- On the complexity of bisimilarity for value-passing processes -- On the expressive power of CCS -- Polarized name passing -- Path balance heuristic for self-adjusting binary search trees -- Pattern matching in compressed texts -- All-pairs min-cut in sparse networks -- Minimizing space usage in evaluation of expression trees -- Smooth surfaces for multi-scale shape representation -- On parallel complexity of planar triangulations -- Computing a largest empty anchored cylinder, and related problems -- Computing hierarchies of clusters from the euclidean minimum spanning tree in linear time -- Determinizing Büchi asynchronous automata -- Achilles and the tortoise climbing up the arithmetical hierarchy -- Generalized temporal verification diagrams -- Model checking of probabilistic and nondeterministic systems.
Summary: This book constitutes the refereed proceedings of the 15th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS '95, held in Bangalore, India in December 1995. The volume presents 31 full revised research papers selected from a total of 106 submissions together with full papers of four invited talks. Among the topics covered are algorithms, software technology, functional programming theory, distributed algorithms, term rewriting and constraint logic programming, complexity theory, process algebras, computational geometry, and temporal logics and verification theory.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references and index.

This book constitutes the refereed proceedings of the 15th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS '95, held in Bangalore, India in December 1995. The volume presents 31 full revised research papers selected from a total of 106 submissions together with full papers of four invited talks. Among the topics covered are algorithms, software technology, functional programming theory, distributed algorithms, term rewriting and constraint logic programming, complexity theory, process algebras, computational geometry, and temporal logics and verification theory.

Looking for MUM and DAD: Text-text comparisons do help -- Branch and bound on the network model -- A near optimal algorithm for the extended cow-path problem in the presence of relative errors -- Efficient algorithms for vertex arboricity of planar graphs -- A condition for the three colourability of planar locally path graphs -- A framework for the specification of reactive and concurrent systems in Z -- Synthesizing different development paradigms: Combining top-down with bottom-up reasoning about distributed systems -- Verifying part of the ACCESS.bus protocol using PVS -- Reusing batch parsers as incremental parsers -- The expressive power of indeterminate primitives in asynchronous computation -- The transformation calculus -- Equational axiomatization of bicoercibility for polymorphic types -- From causal consistency to sequential consistency in shared memory systems -- Observation of software for distributed systems with RCL -- Partiality and approximation schemes for local consistency in networks of constraints -- Maximal extensions of simplification orderings -- Average polynomial time is hard for exponential time under sn-reductions -- On self-testing without the generator bottleneck -- Observing behaviour categorically -- An algorithm for reducing binary branchings -- On the complexity of bisimilarity for value-passing processes -- On the expressive power of CCS -- Polarized name passing -- Path balance heuristic for self-adjusting binary search trees -- Pattern matching in compressed texts -- All-pairs min-cut in sparse networks -- Minimizing space usage in evaluation of expression trees -- Smooth surfaces for multi-scale shape representation -- On parallel complexity of planar triangulations -- Computing a largest empty anchored cylinder, and related problems -- Computing hierarchies of clusters from the euclidean minimum spanning tree in linear time -- Determinizing Büchi asynchronous automata -- Achilles and the tortoise climbing up the arithmetical hierarchy -- Generalized temporal verification diagrams -- Model checking of probabilistic and nondeterministic systems.

Powered by Koha