Foundations of Software Technology and Theoretical Computer Science
Springer Berlin (Verlag)
978-3-540-60692-5 (ISBN)
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 ofclusters 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.
| Erscheint lt. Verlag | 4.12.1995 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | XIII, 523 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 233 mm |
| Gewicht | 707 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik | |
| Schlagworte | algorithm • Algorithm analysis and problem complexity • Algorithmen • algorithms • combinatorics • Complexity • Complexity theory • Computational Geometry • Computer • Computer Science • Concurrency • Komplexitätstheorie • Logic • Mathematical Foundations • Mathematische Grundlagen • Nebenläufigkeit • programming • Programmsemantik • Program Semantics • Term Rewriting • verification |
| ISBN-10 | 3-540-60692-0 / 3540606920 |
| ISBN-13 | 978-3-540-60692-5 / 9783540606925 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
