Probabilistic total store ordering

DOI10.1007/978-3-030-99336-8_12zbMath1528.68074arXiv2201.10213MaRDI QIDQ6166793

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Adwait Godbole, Krishna S., Raj Aryan Agarwal

Publication date: 3 August 2023

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.10213

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Runtime analysis of probabilistic programs with unbounded recursion
• A note on the attractor-property of infinite-state Markov chains
• Simulating perfect channels with probabilistic lossy channels
• Recursive Markov Decision Processes and Recursive Stochastic Games
• What’s Decidable about Weak Memory Models?
• Deciding Fast Termination for Probabilistic VASS with Nondeterminism
• Eager Markov Chains
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Analysing Decisive Stochastic Processes
• Zero-reachability in probabilistic multi-counter automata
• On the verification problem for weak memory models
• Model Checking Probabilistic Pushdown Automata
• Decisive Markov Chains
• Stochastic Games with Lossy Channels
• Efficient Analysis of Probabilistic Programs with an Unbounded Counter

This page was built for publication: Probabilistic total store ordering