Towards abstraction-based probabilistic program analysis

Szekeres Dániel and Majzik István: Towards abstraction-based probabilistic program analysis. In: Acta cybernetica, (26) 3. pp. 671-711. (2024)

[thumbnail of cybernetica_026_numb_003_671-711.pdf]
Preview
Cikk, tanulmány, mű
cybernetica_026_numb_003_671-711.pdf

Download (1MB) | Preview

Abstract

Probabilistic programs that can represent both probabilistic and non-deterministic choices are useful for creating reliability models of complex safety-critical systems that interact with humans or external systems. Such models are often quite complex, so their analysis can be hindered by state-space explosion. One common approach to deal with this problem is the application of abstraction techniques. We present improvements for an abstraction-refinement scheme for the analysis of probabilistic programs, aiming to improve the scalability of the scheme by adapting modern techniques from qualitative software model checking, and make the analysis result more reliable using better convergence checks. We implemented and evaluated the improvements in our Theta model checking framework.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2024
Volume: 26
Number: 3
ISSN: 2676-993X
Page Range: pp. 671-711
Language: English
Publisher: University of Szeged, Institute of Informatics
Place of Publication: Szeged
Related URLs: https://acta.bibl.u-szeged.hu/86904/
DOI: 10.14232/actacyb.298287
Uncontrolled Keywords: Valószínűségi rendszerek, Programozás
Additional Information: Bibliogr.: p. 701-703. ; ill. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2025. Apr. 16. 07:23
Last Modified: 2025. Apr. 16. 07:23
URI: http://acta.bibl.u-szeged.hu/id/eprint/86991

Actions (login required)

View Item View Item