↓ Skip to main content

Mathematical Foundations of Computer Science 1999

Overview of attention for book
Cover of 'Mathematical Foundations of Computer Science 1999'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 On-Line Addition in Real Base
  3. Altmetric Badge
    Chapter 2 Query Languages for Real Number Databases Based on Descriptive Complexity over R
  4. Altmetric Badge
    Chapter 3 The Arithmetical Hierarchy of Real Numbers
  5. Altmetric Badge
    Chapter 4 The Burrows-Wheeler Transform: Theory and Practice
  6. Altmetric Badge
    Chapter 5 Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts
  7. Altmetric Badge
    Chapter 6 Computing and Comparing Semantics of Programs in Four-Valued Logics
  8. Altmetric Badge
    Chapter 7 Foundations of Modular SOS
  9. Altmetric Badge
    Chapter 8 Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
  10. Altmetric Badge
    Chapter 9 On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System
  11. Altmetric Badge
    Chapter 10 The Complexity of the Extended GCD Problem
  12. Altmetric Badge
    Chapter 11 Complexity Results for Confluence Problems
  13. Altmetric Badge
    Chapter 12 Is Your Model Checker on Time?
  14. Altmetric Badge
    Chapter 13 Clausal Resolution for CTL
  15. Altmetric Badge
    Chapter 14 Model Checking and Higher-Order Recursion
  16. Altmetric Badge
    Chapter 15 Multiparty Communication Complexity: Very Hard Functions
  17. Altmetric Badge
    Chapter 16 New Perspectives in Distributed Computing
  18. Altmetric Badge
    Chapter 17 An Improved Disjunctive Strictness Analysis for Lazy Functional Languages
  19. Altmetric Badge
    Chapter 18 Unique Fixed Point Induction for McCarthy’s Amb
  20. Altmetric Badge
    Chapter 19 On Some Topological Properties of Linear Cellular Automata
  21. Altmetric Badge
    Chapter 20 Real-Time Language Recognition by One-Way and Two-Way Cellular Automata
  22. Altmetric Badge
    Chapter 21 Average State Complexity of Operations on Unary Automata
  23. Altmetric Badge
    Chapter 22 Fooling Rebound Automata
  24. Altmetric Badge
    Chapter 23 The Complexity of Minimizing FBDDs
  25. Altmetric Badge
    Chapter 24 Efficient Strongly Universal and Optimally Universal Hashing
  26. Altmetric Badge
    Chapter 25 Lower and Upper Bounds for the Problem of Page Replication in Ring Networks
  27. Altmetric Badge
    Chapter 26 Language-Based Security
  28. Altmetric Badge
    Chapter 27 An Algebraic Approach to Knowledge Representation
  29. Altmetric Badge
    Chapter 28 On the Structure of the Monadic Logic of the Binary Tree
  30. Altmetric Badge
    Chapter 29 A New Space Bound for the Modal Logics K4, KD4 and S4
  31. Altmetric Badge
    Chapter 30 On Approximating the Number of Bases of Exchange Preserving Matroids
  32. Altmetric Badge
    Chapter 31 The Semantic Foundations of a Compositional Proof Method for Synchronously Communicating Processes
  33. Altmetric Badge
    Chapter 32 On Plain and Hereditary History-Preserving Bisimulation
  34. Altmetric Badge
    Chapter 33 Approximating Weak Bisimulation on Basic Process Algebras
  35. Altmetric Badge
    Chapter 34 Edge Coloring of Bipartite Graphs with Constraints
  36. Altmetric Badge
    Chapter 35 An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover
  37. Altmetric Badge
    Chapter 36 On Minimum Edge Ranking Spanning Trees
  38. Altmetric Badge
    Chapter 37 Football Elimination Is Hard to Decide Under the 3-Point-Rule
  39. Altmetric Badge
    Chapter 38 Generalized Regular Counting Classes
  40. Altmetric Badge
    Chapter 39 A Foundation of Programming a Multi-tape Quantum Turing Machine
  41. Altmetric Badge
    Chapter 40 A Type Discipline for Solving Year 2000 Problems in COBOL Programs
  42. Altmetric Badge
    Chapter 41 Type Reconstruction for Functional Programs with Subtyping over a Lattice of Atomic Types
Attention for Chapter 7: Foundations of Modular SOS
Altmetric Badge

Readers on

mendeley
6 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Foundations of Modular SOS
Chapter number 7
Book title
Mathematical Foundations of Computer Science 1999
Published by
Springer, Berlin, Heidelberg, September 1999
DOI 10.1007/3-540-48340-3_7
Book ISBNs
978-3-54-066408-6, 978-3-54-048340-3
Authors

Peter D. Mosses, Mosses, Peter D.

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United Kingdom 1 17%
France 1 17%
Unknown 4 67%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 33%
Professor 1 17%
Professor > Associate Professor 1 17%
Researcher 1 17%
Unknown 1 17%
Readers by discipline Count As %
Computer Science 5 83%
Unknown 1 17%