Parametrizing Reads-From Equivalence for Predictive Monitoring

This document is an arXiv feed (multiple new papers) focused on programming languages, distributed systems, concurrency, verification, and machine learning for code. Key contributions include: (1) parametrized predictive monitoring via k-sliced reorderings that interpolate between Mazurkiewicz traces and reads‑from equivalence and yield constant‑space streaming algorithms for regular specs; (2) extensions to typestates and session types to model mixed‑choice, quantitative constraints, dynamic participation and explicit failure semantics for distributed/web applications; (3) Effpi language/work