Jul 2026· Applied Networking Research Workshop· pp. 103-105· 0 citations· 5 references
Computer Science
Abstract
We present the Measurement Template Library (Mtl), a Go library and runtime for specifying and executing measurements. Mtl provides a framework for specifying and executing extensible, modular, and auditable measurements using generic programming techniques. By leveraging the notion of polymorphic measurement programs, we show how to lift measurement tools/probes into a typed computational context and model. This lifting supports the structured definition and refinement of common data structures, algorithms, and concurrency and interleaving semantics which appear in measurement work. In short, we show that measurement points (i.e., the Linux ping utility, scamper, or RIPE Atlas) are types, and measurements are type expressions.
RT’s regular types offer expressiveness appropriate for capturing a command’s standard input and output streams, support computationally tractable and efficient type checking, and provide an interface encoded as regular expressions familiar to developers versed in the Unix environment.
This paper presents an incremental, classroom-scale approach to building a JIT compiler in manageable steps that successfully supports a Read-Eval-Print Loop and a first-call specialization mechanism.
Shaurya Raswan, Mark Barbone, Nicolás Lehmann et al.· Proceedings of the 27th ACM...· 0 citations
An extension to the CoVer contract language designed to capture and check a broader range of error classes and introduce generic parameter checking and allocation tracking, while keeping generality across both programming model and language is presented.
Yussur Mustafa Oraji, Christian H. Bischof· arXiv.org· 0 citations
This work describes the recovery workflow, the remote-pipe data path, the distributed file reader, and the executor-side optimizations that keep fault-tolerance overhead low on the common path of F RACTAL, a system for fault-tolerant distributed execution of unmodified POSIX shell scripts.
This paper introduces the first verification-aware data-plane language: VeriLucid, which aims to unify programming and specification in one high-level language, with built-in proof automation.
John Sonchack, P. Zave, Jennifer Rexford· Conference on Applications,...· 0 citations
This work shows how higher-order combinators solve higher-order problems of asynchronous calls to a network service, database, or language model uniformly, including timeouts, retries, rate limiting, caching, reentrant locking, and cancellation.
Frank Tip· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
