↓ Skip to main content

Foundations of Software Science and Computation Structures

Overview of attention for book
Cover of 'Foundations of Software Science and Computation Structures'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Foundations of Software Science and Computation Structures
  3. Altmetric Badge
    Chapter 2 Guarded Dependent Type Theory with Coinductive Types
  4. Altmetric Badge
    Chapter 3 Dependent Types and Fibred Computational Effects
  5. Altmetric Badge
    Chapter 4 Game Semantics for Bounded Polymorphism
  6. Altmetric Badge
    Chapter 5 Join Inverse Categories as Models of Reversible Recursion
  7. Altmetric Badge
    Chapter 6 A Coalgebraic View of Bar Recursion and Bar Induction
  8. Altmetric Badge
    Chapter 7 A New Foundation for Finitary Corecursion
  9. Altmetric Badge
    Chapter 8 Fixed-Point Elimination in the Intuitionistic Propositional Calculus
  10. Altmetric Badge
    Chapter 9 A Theory of Monitors
  11. Altmetric Badge
    Chapter 10 Contextual Approximation and Higher-Order Procedures
  12. Altmetric Badge
    Chapter 11 A Theory of Slicing for Probabilistic Control Flow Graphs
  13. Altmetric Badge
    Chapter 12 Verification of Parameterized Communicating Automata via Split-Width
  14. Altmetric Badge
    Chapter 13 Robust Equilibria in Mean-Payoff Games
  15. Altmetric Badge
    Chapter 14 Quantifier Alternation for Infinite Words
  16. Altmetric Badge
    Chapter 15 Synchronizing Automata over Nested Words
  17. Altmetric Badge
    Chapter 16 On Freeze LTL with Ordered Attributes
  18. Altmetric Badge
    Chapter 17 Regular Transformations of Data Words Through Origin Information
  19. Altmetric Badge
    Chapter 18 Trace Refinement in Labelled Markov Decision Processes
  20. Altmetric Badge
    Chapter 19 Qualitative Analysis of VASS-Induced MDPs
  21. Altmetric Badge
    Chapter 20 Metric Temporal Logic with Counting
  22. Altmetric Badge
    Chapter 21 Distributed Synthesis in Continuous Time
  23. Altmetric Badge
    Chapter 22 Unary Resolution: Characterizing Ptime
  24. Altmetric Badge
    Chapter 23 Focused and Synthetic Nested Sequents
  25. Altmetric Badge
    Chapter 24 Strong Normalizability as a Finiteness Structure via the Taylor Expansion of $$\lambda $$ λ -terms
  26. Altmetric Badge
    Chapter 25 Reasoning About Call-by-need by Means of Types
  27. Altmetric Badge
    Chapter 26 Coverability Trees for Petri Nets with Unordered Data
  28. Altmetric Badge
    Chapter 27 Shortest Paths in One-Counter Systems
  29. Altmetric Badge
    Chapter 28 The Invariance Problem for Matrix Semigroups
  30. Altmetric Badge
    Chapter 29 Order-Sorted Rewriting and Congruence Closure
  31. Altmetric Badge
    Chapter 30 Towards a Formal Theory of Graded Monads
  32. Altmetric Badge
    Chapter 31 Profinite Monads, Profinite Equations, and Reiterman’s Theorem
Attention for Chapter 11: A Theory of Slicing for Probabilistic Control Flow Graphs
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
7 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
A Theory of Slicing for Probabilistic Control Flow Graphs
Chapter number 11
Book title
Foundations of Software Science and Computation Structures
Published in
Lecture notes in computer science, April 2016
DOI 10.1007/978-3-662-49630-5_11
Book ISBNs
978-3-66-249629-9, 978-3-66-249630-5
Authors

Torben Amtoft, Anindya Banerjee

Editors

Bart Jacobs, Christof Löding

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 7 100%

Demographic breakdown

Readers by professional status Count As %
Student > Bachelor 3 43%
Student > Ph. D. Student 3 43%
Professor 1 14%
Readers by discipline Count As %
Computer Science 7 100%