Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Julian Müllner, Marcel Moosbrugger, Laura Kovács

Journal title: Proceedings of the ACM on Programming Languages (POPL)

Journal number: Volume 8

Journal publisher: ACM

Published year: 2024

Published pages: 882-910

DOI identifier: 10.1145/3632872