Asparagus: Automated synthesis of parametric gas upper-bounds for smart contracts
Modern programmable blockchains have built-in support for smart contracts, ie programs
that are stored on the blockchain and whose state is subject to consensus. After a smart …
that are stored on the blockchain and whose state is subject to consensus. After a smart …
Finding real bugs in big programs with incorrectness logic
Incorrectness Logic (IL) has recently been advanced as a logical theory for compositionally
proving the presence of bugs—dual to Hoare Logic, which is used to compositionally prove …
proving the presence of bugs—dual to Hoare Logic, which is used to compositionally prove …
Sound and complete certificates for quantitative termination analysis of probabilistic programs
We consider the quantitative problem of obtaining lower-bounds on the probability of
termination of a given non-deterministic probabilistic program. Specifically, given a non …
termination of a given non-deterministic probabilistic program. Specifically, given a non …
Algebro-geometric algorithms for template-based synthesis of polynomial programs
Template-based synthesis, also known as sketching, is a localized approach to program
synthesis in which the programmer provides not only a specification, but also a high-level" …
synthesis in which the programmer provides not only a specification, but also a high-level" …
Quantitative bounds on resource usage of probabilistic programs
Cost analysis, also known as resource usage analysis, is the task of finding bounds on the
total cost of a program and is a well-studied problem in static analysis. In this work, we …
total cost of a program and is a well-studied problem in static analysis. In this work, we …
On algebra of program correctness and incorrectness
B Möller, P O'Hearn, T Hoare - … 2021, Marseille, France, November 2–5 …, 2021 - Springer
Variants of Kleene algebra have been used to provide foundations of reasoning about
programs, for instance by representing Hoare Logic (HL) in algebra. That work has generally …
programs, for instance by representing Hoare Logic (HL) in algebra. That work has generally …
Calculational design of [in] correctness transformational program logics by abstract interpretation
P Cousot - Proceedings of the ACM on Programming Languages, 2024 - dl.acm.org
We study transformational program logics for correctness and incorrectness that we extend
to explicitly handle both termination and nontermination. We show that the logics are …
to explicitly handle both termination and nontermination. We show that the logics are …
Equivalence and Similarity Refutation for Probabilistic Programs
We consider the problems of statically refuting equivalence and similarity of output
distributions defined by a pair of probabilistic programs. Equivalence and similarity are two …
distributions defined by a pair of probabilistic programs. Equivalence and similarity are two …
MDPs as distribution transformers: affine invariant synthesis for safety objectives
Markov decision processes can be viewed as transformers of probability distributions. While
this view is useful from a practical standpoint to reason about trajectories of distributions …
this view is useful from a practical standpoint to reason about trajectories of distributions …
Scalable linear invariant generation with Farkas' lemma
Invariant generation is a classical problem to automatically generate invariants to aid the
formal analysis of programs. In this work, we consider the problem of generating tight linear …
formal analysis of programs. In this work, we consider the problem of generating tight linear …