most citedFlowCFL: A Framework for Type-based Reachability Analysis in the Presence of Mutable Data

1 citations · 1 across the 1 of their papers we have counts for

collaborators
Showing cs.PLShow all

2 papers · 1 filter

cs.PL2020★ 1 cited

FlowCFL: A Framework for Type-based Reachability Analysis in the Presence of Mutable Data

Ana Milanova

Reachability analysis is a fundamental program analysis with a wide variety of applications. We present FlowCFL, a framework for type-based reachability analysis in the presence of…

cs.PL2019

Formalizing Event-Driven Behavior of Serverless Applications

Matthew Obetz, Stacy Patterson, Ana Milanova

We present new operational semantics for serverless computing that model the event-driven relationships between serverless functions, as well as their interaction with platforms se…