Pumping, with or Without Choice
Abstract elided by the publisher.
Related papers
- Beyond the elementary representations of program invariants over algebraic data types PLDI 2021
- Using formal methods to enable more secure vehicles: DARPA's HACMS program ICFP 2014
- Universal Scalability in Declarative Program Analysis (with Choice-Based Combination Pruning) OOPSLA 2025
- Safe Environmental Envelopes of Discrete Systems CAV 2023
- Backtracking without Trailing in CLP(RLin) PLDI 1994
- Shape-diverse DSLs: languages without borders (vision paper) SLE 2018
- Type unsoundness in practice: an empirical study of Dart DLS 2016
- Mitigating the compiler optimization phase-ordering problem using machine learning OOPSLA 2012