Conference item icon

Conference item

Probabilistic verification beyond context-freeness

Abstract:

Probabilistic pushdown automata (recursive state machines) are a widely known model of probabilistic computation associated with many decidable problems concerning termination (time) and lineartime model checking. Higher-order recursion schemes (HORS) are a prominent formalism for the analysis of higher-order computation. Recent studies showed that, for the probabilistic variant of HORS, even the basic problem of determining whether a scheme terminates almost surely is undecidable. Moreover, ...

Expand abstract
Publication status:
Accepted
Peer review status:
Peer reviewed

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Oxford college:
Worcester College; Worcester College; Worcester College; Worcester College; WORCESTER COLLEGE
Role:
Author
Publisher:
Association for Computing Machinery Publisher's website
Host title:
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2022)
Acceptance date:
2022-04-14
Event title:
37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2022)
Event location:
Haifa, Israel
Event website:
https://lics.siglog.org/lics22/
Event start date:
2022-08-02T00:00:00Z
Event end date:
2022-08-05T00:00:00Z
Language:
English
Keywords:
Pubs id:
1264308
Local pid:
pubs:1264308
Deposit date:
2022-06-21

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP