Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Stanford, Caleb"'
Autor:
Venugopalan, Hari, Vijayanand, Shreyas Madhav Ambattur, Stanford, Caleb, Crossen, Stephanie, King, Samuel T.
We present GlucOS, a novel system for trustworthy automated insulin delivery. Fundamentally, this paper is about a system we designed, implemented, and deployed on real humans and the lessons learned from our experiences. GlucOS combines algorithmic
Externí odkaz:
http://arxiv.org/abs/2406.18262
Autor:
Cutler, Joseph W., Watson, Christopher, Nkurumeh, Emeka, Hilliard, Phillip, Goldstein, Harrison, Stanford, Caleb, Pierce, Benjamin C.
We propose a rich foundational theory of typed data streams and stream transformers, motivated by two high-level goals: (1) The type of a stream should be able to express complex sequential patterns of events over time. And (2) it should describe the
Externí odkaz:
http://arxiv.org/abs/2307.09553
Autor:
Stanford, Caleb, Veanes, Margus
Identifying live and dead states in an abstract transition system is a recurring problem in formal verification; for example, it arises in our recent work on efficiently deciding regex constraints in SMT. However, state-of-the-art graph algorithms fo
Externí odkaz:
http://arxiv.org/abs/2301.05308
Compared to fixed-function switches, the flexibility of programmable switches comes at a cost, as programmer mistakes frequently result in subtle bugs in the network data plane. In this paper, we present the design and implementation of FP4, a fuzz-t
Externí odkaz:
http://arxiv.org/abs/2207.13147
Real-time data processing applications with low latency requirements have led to the increasing popularity of stream processing systems. While such systems offer convenient APIs that can be used to achieve data parallelism automatically, they offer l
Externí odkaz:
http://arxiv.org/abs/2104.04512
Motivated by real-time monitoring and data processing applications, we develop a formal theory of quantitative queries for streaming data that can be evaluated efficiently. We consider the model of unambiguous Cost Register Automata (CRAs), which are
Externí odkaz:
http://arxiv.org/abs/1807.03865
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We propose an automata-theoretic framework for modularly expressing computations on streams of data. With weighted automata as a starting point, we identify three key features that are useful for an automaton model for stream processing: expressing t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::432c73c686e082b3d0abdf0e3d4754ec
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.