Reproduce “Techniques and Applications of Computation Slicing” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Neeraj Mittal, Vijay K. Garg
Researchers from The University of Texas at Dallas and The University of Texas at Austin developed computation slicing, a preprocessing technique that reduces the state-space for global predicate detection in distributed systems. This method yields exponential improvements in time and space for certain predicate classes and applies to areas like fault tolerance and checkpointing.
Key insights
- A computation slice is proven to exist and be unique for any global predicate, with its properties linked to the concept of "regular predicates."
- The set of all consistent cuts of any distributed computation forms a distributive lattice, providing a strong theoretical foundation for slicing using Birkhoff's Representation Theorem.
- The work establishes that polynomial-time predicate detection is equivalent to polynomial-time slice computation, highlighting slicing's fundamental role.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.