Cited By
View all- Chatterjee KGoharshady ENovotný PŽikelić Đ(2024)Equivalence and Similarity Refutation for Probabilistic ProgramsProceedings of the ACM on Programming Languages10.1145/36564628:PLDI(2098-2122)Online publication date: 20-Jun-2024
We study decidability problems for equivalence of probabilistic programs, for a core probabilistic programming language over finite fields of fixed characteristic. The programming language supports uniform sampling, addition, multiplication and ...
We show that strict deterministic propositional dynamic logic with intersection is highly undecidable, solving a problem in the Stanford Encyclopedia of Philosophy. In fact we show something quite a bit stronger. We introduce the construction of program ...
The maximal existential (respectively, universal) width of an alternating finite automaton (AFA) on a string w is the maximal number of existential choices encountered in one branch (respectively, the maximal number of universal parallel branches)...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inView or Download as a PDF file.
PDFView online with eReader.
eReaderView this article in Full Text.
Full TextView this article in HTML Format.
HTML Format