Model checking temporal properties of recursive probabilistic programs

DOI10.1007/978-3-030-99253-8_23MaRDI QIDQ6830521zbMATH OpenFDO

Authors Tobias Winkler, Joost-Pieter Katoen

Publication date 23 January 2024

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-99253-8_23

zbMATH Keywords

CaRetmodel checkingprobabilistic pushdown automataprobabilistic recursive programsvisibly pushdown languages

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(1)

• Probabilistic input-driven pushdown automata

This page was built for publication: Model checking temporal properties of recursive probabilistic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6830521)