Issue Downloads
Non-polynomial Worst-Case Analysis of Recursive Programs
We study the problem of developing efficient approaches for proving worst-case bounds of non-deterministic recursive programs. Ranking functions are sound and complete for proving termination and worst-case bounds of non-recursive programs. First, we ...
On the Impact of Programming Languages on Code Quality: A Reproduction Study
In a 2014 article, Ray, Posnett, Devanbu, and Filkov claimed to have uncovered a statistically significant association between 11 programming languages and software defects in 729 projects hosted on GitHub. Specifically, their work answered four research ...
Environmental Bisimulations for Probabilistic Higher-order Languages
Environmental bisimulations for probabilistic higher-order languages are studied. In contrast with applicative bisimulations, environmental bisimulations are known to be more robust and do not require sophisticated techniques such as Howe’s in the proofs ...
Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth
- Krishnendu Chatterjee,
- Amir Kafshdar Goharshady,
- Prateesh Goyal,
- Rasmus Ibsen-Jensen,
- Andreas Pavlogiannis
Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, and so on. Recursive state machines (RSMs) are standard models for interprocedural analysis. We consider a general ...