Frans Kaashoek

Frans Kaashoek

Auto-generated profile, based on publicly available information

Frans Kaashoek

MIT, Cambridge, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 October 2023
Verified
Conference Paper
Open access
USUpamanyu Sharma
Upamanyu Sharma
RJRalf Jung
Ralf Jung
JTJoseph Tassarotti
Joseph Tassarotti
FKFrans Kaashoek
Frans Kaashoek
NZNickolai Zeldovich
Nickolai Zeldovich
Grove is a concurrent separation logic library for verifying distributed systems. Grove is the first to handle time-based leases, including their interaction with reconfiguration, crash recovery, thread-level concurrency, and unreliable networks. This paper uses Grove to verify several distributed system components written in Go, including vKV, a realistic distributed multi-threaded key-value store. vKV supports reconfiguration, primary/backup replication, and crash recovery, and uses leases to execute read-only requests on any replica. vKV achieves high performance (67--73% of Redis on a single core), scales with more cores and more backup replicas (achieving about 2× the throughput when going from 1 to 3 servers), and can safely execute reads while reconfiguring.

4 November 2024
Verified
Conference Paper
Open access
ASAriel Szekely
Ariel Szekely
ABAdam Belay
Adam Belay
RMRobert Morris
Robert Morris
MKM. Frans Kaashoek
M. Frans Kaashoek
Many cloud applications use both serverless functions, for bursts of stateless parallel computation, and container orchestration, for long-running microservices and tasks that need to interact. Ideally a single platform would offer the union of these systems' capabilities, but neither is sufficient to act as that single platform: serverless functions are lightweight but cannot act as servers with long-term state, while container orchestration offers general-purpose computation but instance start-up takes too long to support burst parallelism. σOS is a new multi-tenant cloud operating system that combines the best of container orchestration and serverless in one platform with one API. σOS computations, called procs, can be long-running, stateful, and interact with each other, making them a good match for both serverless and microservice tasks. A key aspect of the σOS design is its cloud-centric API, which provides flexible management of computation, a novel abstraction for communication endpoints, σEPs---which allow procs of a tenant to communicate efficiently but prohibits procs from sending packets to other tenants---and a flexible naming system to name, for example, σEPs. Quick proc start-up is important for serverless uses. A key enabling observation is that both serverless and microservice applications rely on cloud services for much of the work traditionally done by the local OS (e.g., access to durable storage and additional compute resources). σOS exploits this observation by providing only a small and generic local operating system image to each proc, which can be created much more quickly than a container orchestration instance since σOS need not install application-specific filesystem content or (due to σOS's σEPs) configure an isolated overlay network. Microbenchmarks show that σOS can cold start a proc in 7.7 msec and can create 36,650 procs per second, distributing them over a 24-machine cluster. An evaluation of σOS with two microservice applications from DeathStarBench, a MapReduce application, and an image processing benchmark, shows that the σOS API supports both microservices and lambda-style computations, and provides better performance than corresponding versions on AWS Lambda and Kubernetes.

4 November 2024
Verified
Conference Paper
Open access
AAAnish Athalye
Anish Athalye
HCHenry Corrigan-Gibbs
Henry Corrigan-Gibbs
FKFrans Kaashoek
Frans Kaashoek
JTJoseph Tassarotti
Joseph Tassarotti
NZNickolai Zeldovich
Nickolai Zeldovich
Parfait is a framework for proving that an implementation of a hardware security module (HSM) leaks nothing more than what is mandated by an application specification. Parfait proofs cover the software and the hardware of an HSM, which catches bugs above the cycle-level digital circuit abstraction, including timing side channels. Parfait's contribution is a scalable approach to proving security and non-leakage by using intermediate levels of abstraction and relating them with transitive information-preserving refinement. This enables Parfait to use different techniques to verify the implementation at different levels of abstraction, reuse existing verified components such as CompCert, and automate parts of the proof, while still providing end-to-end guarantees. We use Parfait to verify four HSMs, including an ECDSA certificate-signing HSM and a password-hashing HSM, on top of the OpenTitan Ibex and PicoRV32 processors. Parfait provides strong guarantees for these HSMs: for instance, it proves that the ECDSA-on-Ibex HSM implementation---2,300 lines of code and 13,500 lines of Verilog---leaks nothing more than what is allowed by a 40-line specification of its behavior.

23 October 2023
Verified
Conference Paper
Open access
LTLillian Tsai
Lillian Tsai
HGHannah Gross
Hannah Gross
EKEddie Kohler
Eddie Kohler
FKFrans Kaashoek
Frans Kaashoek
MSMalte Schwarzkopf
Malte Schwarzkopf
Edna is a system that helps web applications allow users to remove their data without permanently losing their accounts, anonymize their old data, and selectively dissociate personal data from public profiles. Edna helps developers support these features while maintaining application functionality and referential integrity via disguising and revealing transformations. Disguising selectively renders user data inaccessible via encryption, and revealing enables the user to restore their data to the application. Edna's techniques allow transformations to compose in any order, e.g., deleting a previously anonymized user's account, or restoring an account back to an anonymized state. Experiments with Edna that add disguising and revealing transformations to three real-world applications show that Edna enables new privacy features in existing applications with low developer effort, is simpler than alternative approaches, and adds limited overhead to applications.

28 September 2026
Verified
Conference Paper
Open access
YCYun-Sheng Chang
Yun-Sheng Chang
JTJoseph Tassarotti
Joseph Tassarotti
FKFrans Kaashoek
Frans Kaashoek
NZNickolai Zeldovich
Nickolai Zeldovich

23 October 2023
Verified
Conference Paper
Open access
AAAnish Athalye
Anish Athalye
FKFrans Kaashoek
Frans Kaashoek
NZNickolai Zeldovich
Nickolai Zeldovich
JTJoseph Tassarotti
Joseph Tassarotti