Towards abstraction-based probabilistic program analysis
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-spac...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
University of Szeged, Institute of Informatics
Szeged
2024
|
| Sorozat: | Acta cybernetica
26 No. 3 |
| Kulcsszavak: | Valószínűségi rendszerek, Programozás |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.298287 |
| Online Access: | http://acta.bibl.u-szeged.hu/86991 |
| Tartalmi kivonat: | 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. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 671-711 |
| ISSN: | 2676-993X |