Static Call Graph Construction in AWS Lambda Serverless Applications

Authors: 

Matthew Obetz, Stacy Patterson, and Ana Milanova, Rensselaer Polytechnic Institute

Abstract: 

We present new means for performing static program analysis on serverless programs. We propose a new type of call graph that captures the stateless, event-driven nature of such programs and describe a method for constructing these new extended service call graphs. Next, we survey applications of program analysis that can leverage our extended service call graphs to answer questions about code that executes on a serverless platform. We present findings on the applicability of our techniques to real open source serverless programs. Finally, we close with several open questions about how to best incorporate static analysis in problem solving for developing serverless applications.

Open Access Media

USENIX is committed to Open Access to the research presented at our events. Papers and proceedings are freely available to everyone once the event begins. Any video, audio, and/or slides that are posted after the event are also free and open to everyone. Support USENIX and our commitment to Open Access.

BibTeX
@inproceedings {234839,
author = {Matthew Obetz and Stacy Patterson and Ana Milanova},
title = {Static Call Graph Construction in {AWS} Lambda Serverless Applications},
booktitle = {11th {USENIX} Workshop on Hot Topics in Cloud Computing (HotCloud 19)},
year = {2019},
address = {Renton, WA},
url = {https://www.usenix.org/conference/hotcloud19/presentation/obetz},
publisher = {{USENIX} Association},
}