POPL 2026 (series) / TPSA 2026 (series) / Theory and Practice of Static Analysis 2026 /
Tracking Dynamically Bound Variable Dependencies
Some Lisp dialects rely heavily on “action at a distance” through dynamically bound variables. We present an analysis that approximates the transitive dynamic-variable dependencies of Emacs Lisp programs, as well as those of Emacs Lisp primitives written in C. Applied to the Emacs code base and 210 popular ELisp libraries, our prototype implementation surfaces subtle bugs and reveals unexpectedly large dynamic-variable dependency sets.
Mon 12 JanDisplayed time zone: Brussels, Copenhagen, Madrid, Paris change
Mon 12 Jan
Displayed time zone: Brussels, Copenhagen, Madrid, Paris change
11:00 - 12:30 | |||
11:00 3mTalk | In Memoriam: Richard Bornat TPSA | ||
11:03 43mKeynote | Building the Cloud with Continuous Assurances using Static Analysis TPSA Subarno Banerjee Amazon Web Services | ||
11:46 22mTalk | Tracking Dynamically Bound Variable Dependencies TPSA | ||
12:08 22mTalk | Gradually Retrofitting Assurance into Systems Software: A Separation-Logic Approach TPSA Rini Banerjee University of Cambridge, Zain K Aamer University of Pennsylvania, Hiroyuki Katsura University of Cambridge, David Kaloper-Meršinjak University of Cambridge, Dimitrios J. Economou University of Cambridge, Kayvan Memarian University of Cambridge, Dhruv Makwana University of Cambridge, Neel Krishnaswami University of Cambridge, Benjamin C. Pierce University of Pennsylvania, Christopher Pulte University of Cambridge, Peter Sewell University of Cambridge | ||