SafePar is introduced, a specification and monitoring framework for policies over concurrent microservice executions that constrains both the order of API calls and their series-parallel structure and shows that SafePar enforces rich concurrency-aware policies while incurring only millisecond-scale latency overhead.
Abstract
Modern cloud applications are built from loosely-coupled microservices that coordinate through well-defined APIs to service user requests. A single API request often triggers multiple downstream API calls, some executed sequentially and others spawned asynchronously in parallel. To certify safe and secure inter-service interactions in such applications, security and compliance teams must enforce policies not only over nested call/return structure, but also over the parallel structure of an execution: which calls may run concurrently, how many parallel branches can be spawned, and what combination of branch outcomes are allowed. However, existing runtime enforcement mechanisms typically model executions as sequential or purely nested traces, and cannot capture the parallel structure introduced by asynchronous API calls. Furthermore, since application implementations may not be accessible to security and compliance teams, the policy enforcement mechanism should be decoupled from the service implementation. We introduce SafePar, a specification and monitoring framework for policies over concurrent microservice executions. A SafePar policy constrains both the order of API calls and their series-parallel structure. To support seamless deployments, each policy is compiled into a series-parallel visibly pushdown automaton, a new model of computation we propose in this work, that drives a distributed runtime monitor implemented on top of the servicemesh layer. Our technique is blackbox and non-invasive: it requires no access or changes to the service implementation. Our experiments show that SafePar enforces rich concurrency-aware policies while incurring only millisecond-scale latency overhead.
Many cloud-based applications are organized as loosely coupled microservices, where invoking a service's API triggers a cascade of APIs across many services and leads to inter-service exchange of API parameters and output responses. Current tools for monitoring microservice safety properties have limited expressiveness...
Karuna Grewal, B. Godfrey, Justin Hsu· arXiv.org· 0 citations
This work designs Safe⟨ T⟩, an automaton-theoretic runtime monitoring framework for specifying and enforcing control-flow and data-aware policies over black-box distributed systems and builds a distributed runtime monitor on top of an emerging network infrastructure layer that can control inter-component communication.
Karuna Grewal· Companion Proceedings of the...· 0 citations
Asynchronous programming is widely used in modern Java software, including server-side processing, network I/O, reactive streams, task scheduling, and RPC communication. Unlike synchronous executions, resource creation and release in asynchronous programs are distributed across callbacks, Future/Promise chains, threads...
Jinyoung Kim, Jinseok Heo, Dongwook Choi et al.· Proceedings of the ACM on So...· 0 citations
The Message Passing Interface (MPI) is the standard programming model for high-performance computing, yet nondeterministic scheduling in concurrent executions makes reliability assurance highly challenging. Beyond deadlocks, property-related bugs such as modifying a send buffer before a nonblocking send completes or ac...
Jia-Qiang Yao, Hao-Cheng Geng, Zhen-Bang Chen· Proceedings of the ACM on So...· 0 citations
Kamera is presented, a system for testing CCPs that uses partial simulation to execute the code of multiple interacting controllers against a lightweight model of the Kubernetes runtime and achieves a 1,781× speedup over existing cluster-based controller testing approaches.
Tim Goodwin, Lindsey Kuper, Andi Quinn· Proceedings of the ACM SIGOP...· 0 citations
This work introduces an append-only logical event log that abstracts implementation details and enables a Kamp-style translation of Linear Temporal Logic into First-Order Logic, which enables deductive program verifiers to reason about progress via monotonic timestamps without needing native temporal logic support.
Ti Zhou, Zi-Hao Zhang, O. Chowdhury et al.· Proceedings of the ACM SIGOP...· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.