Mathematical Foundations of Computer Science 1996

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 136 Word level model checking
3. Altmetric Badge
   Chapter 137 Code problems on traces
4. Altmetric Badge
   Chapter 138 Models of DNA computation
5. Altmetric Badge
   Chapter 139 Theory and practice of action semantics
6. Altmetric Badge
   Chapter 140 Linear time temporal logics over Mazurkiewicz traces
7. Altmetric Badge
   Chapter 141 Partial order reduction: Model-checking using representatives
8. Altmetric Badge
   Chapter 142 Nonmonotonic rule systems: Forward chaining, constraints, and complexity
9. Altmetric Badge
   Chapter 143 Mind the gap! Abstract versus concrete models of specifications
10. Altmetric Badge
    Chapter 144 A sequent calculus for subtyping polymorphic types
11. Altmetric Badge
    Chapter 145 Kolmogorov complexity: Recent research in Moscow
12. Altmetric Badge
    Chapter 146 A modal logic for data analysis
13. Altmetric Badge
    Chapter 147 From specifications to programs: A fork-algebraic approach to bridge the gap
14. Altmetric Badge
    Chapter 148 Logic of predicates with explicit substitutions
15. Altmetric Badge
    Chapter 149 On the query complexity of sets
16. Altmetric Badge
    Chapter 150 A Lambda Calculus of incomplete objects
17. Altmetric Badge
    Chapter 151 Bisimilarity problems requiring exponential time (Extended abstract)
18. Altmetric Badge
    Chapter 152 Linear dynamic Kahn networks are deterministic
19. Altmetric Badge
    Chapter 153 Shortest path problems with time constraints
20. Altmetric Badge
    Chapter 154 Parallel Alternating-Direction Access Machine
21. Altmetric Badge
    Chapter 155 Specification and verification of timed lazy systems
22. Altmetric Badge
    Chapter 156 A class of information logics with a decidable validity problem
23. Altmetric Badge
    Chapter 157 On the power of nonconservative PRAM
24. Altmetric Badge
    Chapter 158 Self-similarity viewed as a local property via tile sets
25. Altmetric Badge
    Chapter 159 Simulation of specification statements in Hoare logic
26. Altmetric Badge
    Chapter 160 Equational properties of iteration in algebraically complete categories
27. Altmetric Badge
    Chapter 161 On unconditional transfer
28. Altmetric Badge
    Chapter 162 (poly(log log n ), poly(log log n ))—Restricted verifiers are unlikely to exist for languages in $$\mathcal{N}\mathcal{P}$$ *
29. Altmetric Badge
    Chapter 163 Minimizing congestion of layouts for ATM networks with faulty links
30. Altmetric Badge
    Chapter 164 Polynomial automaticity, context-free languages, and fixed points of morphisms (Extended abstract)
31. Altmetric Badge
    Chapter 165 Causal testing
32. Altmetric Badge
    Chapter 166 Construction of list homomorphisms by tupling and fusion
33. Altmetric Badge
    Chapter 167 Probabilistic metric semantics for a simple language with recursion
34. Altmetric Badge
    Chapter 168 Dynamic graphs
35. Altmetric Badge
    Chapter 169 Equations on trees
36. Altmetric Badge
    Chapter 170 On the equivalence problem for E-pattern languages
37. Altmetric Badge
    Chapter 171 Specifying and verifying parametric processes
38. Altmetric Badge
    Chapter 172 On saturation with flexible function symbols
39. Altmetric Badge
    Chapter 173 Approximating good simultaneous Diophantine approximations is almost NP-hard
40. Altmetric Badge
    Chapter 174 On the conjugation of Standard morphisms
41. Altmetric Badge
    Chapter 175 A semantic matching algorithm: Analysis and implementation
42. Altmetric Badge
    Chapter 176 Routing on triangles, tori and honeycombs
43. Altmetric Badge
    Chapter 177 A uniform analysis of trie structures that store prefixing-keys with application to doubly-chained prefixing-tries
44. Altmetric Badge
    Chapter 178 On fairness in terminating and reactive programs
45. Altmetric Badge
    Chapter 179 Polynomial time samplable distributions
46. Altmetric Badge
    Chapter 180 From static to dynamic abstract data-types