On the public citation graph
Abstraction, Refinement and Proof for Probabilistic Systems
0 signed · 341 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/0-387-27006-x_7openalex-snapshot
Proved rules for probabilistic loops
inferredcites →https://doi.org/10.1007/978-1-4471-5355-9_3openalex-snapshot
Data Refinement and Simulations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11415787_10openalex-snapshot
The Challenge of Probabilistic Event B—Extended Abstract—
inferred← citeshttps://doi.org/10.1007/11415787_21openalex-snapshot
Development via Refinement in Probabilistic B — Foundation and Case Study
inferred← citeshttps://doi.org/10.1007/11423348_12openalex-snapshot
Of Probabilistic wp and CSP—and Compositionality
inferred← citeshttps://doi.org/10.1007/11526841_9openalex-snapshot
Compositional Specification and Analysis of Cost-Based Properties in Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/11560647_29openalex-snapshot
Quantitative Temporal Logic Mechanized in HOL
inferred← citeshttps://doi.org/10.1007/11591191_37openalex-snapshot
Towards Automated Proof Support for Probabilistic Distributed Systems
inferred← citeshttps://doi.org/10.1007/11603009openalex-snapshot
Formal Modeling and Analysis of Timed Systems
inferred← citeshttps://doi.org/10.1007/11783596_21openalex-snapshot
The Shadow Knows: Refinement of Ignorance in Sequential Programs
inferred← citeshttps://doi.org/10.1007/11783596_6openalex-snapshot
Proofs of Randomized Algorithms in Coq
inferred← citeshttps://doi.org/10.1007/11813040_10openalex-snapshot
Quantitative Refinement and Model Checking for the Analysis of Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/11817949_5openalex-snapshot
Probability and Nondeterminism in Operational Models of Concurrency
inferred← citeshttps://doi.org/10.1007/11828563_20openalex-snapshot
Using Probabilistic Kleene Algebra for Protocol Verification
inferred← citeshttps://doi.org/10.1007/11828563_3openalex-snapshot
Computations and Relational Bundles
inferred← citeshttps://doi.org/10.1007/11901433_21openalex-snapshot
Reasoning Algebraically About Probabilistic Loops
inferred← citeshttps://doi.org/10.1007/11916246_15openalex-snapshot
Programming-Logic Analysis of Fault Tolerance: Expected Performance of Self-stabilisation
inferred← citeshttps://doi.org/10.1007/11921240_4openalex-snapshot
Quantitative μ-Calculus Analysis of Power Management in Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-02768-1_11openalex-snapshot
New Approaches for Almost-Sure Termination of Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-02928-9_3openalex-snapshot
Formalizing Hoare Logic in PVS
inferred← citeshttps://doi.org/10.1007/978-3-030-11245-5_22openalex-snapshot
Termination of Nondeterministic Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-28377-3_47openalex-snapshot
Refining the Imprecise Meaning of Non-determinism in the Web by Strategic Games
inferred← citeshttps://doi.org/10.1007/978-3-030-29436-6_16openalex-snapshot
Computing Expected Runtimes for Constant Probability Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-31784-3_15openalex-snapshot
Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
inferred← citeshttps://doi.org/10.1007/978-3-030-45234-6_9openalex-snapshot
Computing Program Reliability Using Forward-Backward Precondition Analysis and Model Counting
inferred← citeshttps://doi.org/10.1007/978-3-030-53291-8_27openalex-snapshot
PrIC3: Property Directed Reachability for MDPs
inferred← citeshttps://doi.org/10.1007/978-3-030-55089-9_3openalex-snapshot
Weakest Preexpectation Semantics for Bayesian Inference
inferred← citeshttps://doi.org/10.1007/978-3-030-61362-4_12openalex-snapshot
Correctness by Construction for Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-64276-1_12openalex-snapshot
Analysis of Bayesian Networks via Prob-Solvable Loops
inferred← citeshttps://doi.org/10.1007/978-3-030-68446-4_12openalex-snapshot
Generating Functions for Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-72016-2_14openalex-snapshot
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_25openalex-snapshot
Latticed k-Induction with an Application to Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-88701-8_28openalex-snapshot
Automated Reasoning for Probabilistic Sequential Programs with Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-030-90870-6_33openalex-snapshot
On Lexicographic Proof Rules for Probabilistic Termination
inferred← citeshttps://doi.org/10.1007/978-3-030-92124-8_16openalex-snapshot
A Debugger for Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-94583-1_22openalex-snapshot
Out of Control: Reducing Probabilistic Models by Control-State Elimination
inferred← citeshttps://doi.org/10.1007/978-3-031-13185-1_3openalex-snapshot
Data-Driven Invariant Learning for Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-13185-1_4openalex-snapshot
Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-13185-1_5openalex-snapshot
Does a Program Yield the Right Distribution?
inferred← citeshttps://doi.org/10.1007/978-3-031-37709-9_5openalex-snapshot
MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8_2openalex-snapshot
On the Hardness of Analyzing Quantum Programs Quantitatively
inferred← citeshttps://doi.org/10.1007/978-3-031-66673-5_10openalex-snapshot
Uncertainty and Probabilistic UTP
inferred← citeshttps://doi.org/10.1007/978-3-031-67114-2_11openalex-snapshot
A Tour Through the Programming Choices: Semantics and Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-73709-1_10openalex-snapshot
The ProbInG Project: Advancing Automatic Analysis of Probabilistic Loops
inferred← citeshttps://doi.org/10.1007/978-3-031-75775-4_16openalex-snapshot
Model Checking and Strategy Synthesis with Abstractions and Certificates
inferred← citeshttps://doi.org/10.1007/978-3-031-75783-9_13openalex-snapshot
Towards a Proof System for Probabilistic Dynamic Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-75783-9_14openalex-snapshot
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-031-75783-9_2openalex-snapshot
Sound and Complete Techniques for Reasoning About Termination
inferred← citeshttps://doi.org/10.1007/978-3-031-75783-9_6openalex-snapshot
Symbolic Quantitative Information Flow for Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-75783-9_7openalex-snapshot
Static Slicing for Probabilistic Programs: An Overview
inferred← citeshttps://doi.org/10.1007/978-3-031-75783-9_8openalex-snapshot
Polar: An Algebraic Analyzer for (Probabilistic) Loops
inferred← citeshttps://doi.org/10.1007/978-3-031-75783-9_9openalex-snapshot
Quantum Computing: From Weakest Preconditions to Voltage Pulses
inferred← citeshttps://doi.org/10.1007/978-3-031-91118-7_13openalex-snapshot
A Program Logic for Concurrent Randomized Programs in the Oblivious Adversary Model
inferred← citeshttps://doi.org/10.1007/978-3-031-91118-7_15openalex-snapshot
Verifying Algorithmic Versions of the Lovász Local Lemma
inferred← citeshttps://doi.org/10.1007/978-3-031-98679-6_4openalex-snapshot
On the Almost-Sure Termination of Probabilistic Counter Programs
inferred← citeshttps://doi.org/10.1007/978-3-032-11176-0_16openalex-snapshot
Weighted Automata for Exact Inference in Discrete Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-03545-1_17openalex-snapshot
Formalizing Probabilistic Noninterference
inferred← citeshttps://doi.org/10.1007/978-3-319-06251-8_8openalex-snapshot
Preparing Relational Algebra for “Just Good Enough” Hardware
inferred← citeshttps://doi.org/10.1007/978-3-319-08970-6_12openalex-snapshot
From Operational Models to Information Theory; Side Channels in pGCL with Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-319-10936-7_6openalex-snapshot
Expectation Invariants for Probabilistic Program Loops as Fixed Points
inferred← citeshttps://doi.org/10.1007/978-3-319-21690-4_44openalex-snapshot
Counterexample-Guided Polynomial Loop Invariant Generation by Lagrange Interpolation
inferred← citeshttps://doi.org/10.1007/978-3-319-39519-7_16openalex-snapshot
On Dynamical Probabilities, or: How to Learn to Shoot Straight
inferred← citeshttps://doi.org/10.1007/978-3-319-43425-4_14openalex-snapshot
Inferring Covariances for Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-46520-3_5openalex-snapshot
Bounded Model Checking for Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_31openalex-snapshot
A Storm is Coming: A Modern Probabilistic Model Checker
inferred← citeshttps://doi.org/10.1007/978-3-319-66706-5_1openalex-snapshot
Probabilistic Horn Clause Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-68167-2_26openalex-snapshot
Finding Polynomial Loop Invariants for Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_7openalex-snapshot
How long, O Bayesian network, will I sample thee?
inferred← citeshttps://doi.org/10.1007/978-3-319-91476-3_19openalex-snapshot
Web Apps and Imprecise Probabilitites
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_21openalex-snapshot
The 10,000 Facets of MDP Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-68237-0_9openalex-snapshot
Proofs and Refutations for Probabilistic Refinement
inferred← citeshttps://doi.org/10.1007/978-3-540-70594-9_14openalex-snapshot
Probabilistic Choice in Refinement Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-71316-6_25openalex-snapshot
Scalar Outcomes Suffice for Finitary Probabilistic Testing
inferred← citeshttps://doi.org/10.1007/978-3-540-73210-5_16openalex-snapshot
Qualitative Probabilistic Modelling in Event-B
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_38openalex-snapshot
Magnifying-Lens Abstraction for Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-76650-6_13openalex-snapshot
Automating Refinement Checking in Probabilistic System Design
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_23openalex-snapshot
Least Upper Bounds for Probability Measures and Their Applications to Abstractions
inferred← citeshttps://doi.org/10.1007/978-3-540-87603-8_40openalex-snapshot
From ABZ to Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-540-89437-7_11openalex-snapshot
Ensemble Engineering and Emergence
inferred← citeshttps://doi.org/10.1007/978-3-540-89437-7_8openalex-snapshot
Formal Ensemble Engineering
inferred← citeshttps://doi.org/10.1007/978-3-540-93900-9_17openalex-snapshot
Abstraction Refinement for Probabilistic Software
inferred← citeshttps://doi.org/10.1007/978-3-642-03466-4_3openalex-snapshot
The Secret Art of Computer Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_19openalex-snapshot
Testing Finitary Probabilistic Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-05089-3_30openalex-snapshot
Unifying Probability with Nondeterminism
inferred← citeshttps://doi.org/10.1007/978-3-642-05089-3_5openalex-snapshot
Security, Probability and Nearly Fair Coins in the Cryptographers’ Café
inferred← citeshttps://doi.org/10.1007/978-3-642-14052-5_10openalex-snapshot
Programming Language Techniques for Cryptographic Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_19openalex-snapshot
Compositional Closure for Bayes Risk in Probabilistic Noninterference
inferred← citeshttps://doi.org/10.1007/978-3-642-15769-1_24openalex-snapshot
Linear-Invariant Generation for Probabilistic Programs:
inferred← citeshttps://doi.org/10.1007/978-3-642-16265-7_20openalex-snapshot
Towards Probabilistic Modelling in Event-B
inferred← citeshttps://doi.org/10.1007/978-3-642-16690-7_13openalex-snapshot
Probabilistic Choice, Reversibility, Loops, and Miracles
inferred← citeshttps://doi.org/10.1007/978-3-642-19718-5_5openalex-snapshot
Measure Transformer Semantics for Bayesian Machine Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-21070-9_20openalex-snapshot
On Probabilistic Kleene Algebras, Automata and Simulations
inferred← citeshttps://doi.org/10.1007/978-3-642-24124-6_3openalex-snapshot
Quantitative Verification of System Safety in Event-B
inferred← citeshttps://doi.org/10.1007/978-3-642-25873-2_16openalex-snapshot
Probabilistic Compositional Reasoning for Guaranteeing Fault Tolerance Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-28869-2_9openalex-snapshot
Probabilistic Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-642-29485-3_28openalex-snapshot
Dexter Kozen’s Influence on the Theory of Labelled Markov Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-30729-4_17openalex-snapshot
Formal Modelling and Verification of Service-Oriented Systems in Probabilistic Event-B
inferred← citeshttps://doi.org/10.1007/978-3-642-31113-0_5openalex-snapshot
Elementary Probability Theory in the Eindhoven Style
inferred← citeshttps://doi.org/10.1007/978-3-642-31606-7_5openalex-snapshot
Typed Linear Algebra for Weigthed (Probabilistic) Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-35705-3_2openalex-snapshot
Unifying Theories of Programming with Monads
inferred← citeshttps://doi.org/10.1007/978-3-642-35705-3_5openalex-snapshot
A Probabilistic Theory of Designs Based on Distributions
inferred← citeshttps://doi.org/10.1007/978-3-642-39634-2_23openalex-snapshot
Practical Probability: Applying pGCL to Lattice Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-39718-9_6openalex-snapshot
From Distributions to Probabilistic Reactive Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_34openalex-snapshot
Probabilistic Program Analysis with Martingales
inferred← citeshttps://doi.org/10.1007/978-3-642-40196-1_17openalex-snapshot
Prinsys—On a Quest for Probabilistic Loop Invariants
inferred← citeshttps://doi.org/10.1007/978-3-642-54792-8_5openalex-snapshot
Abstract Channels and Their Robust Information-Leakage Ordering
inferred← citeshttps://doi.org/10.1007/978-3-662-45489-3openalex-snapshot
Stochastic Model Checking. Rigorous Dependability Analysis Using Model Checking Techniques for Stochastic Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-45489-3_3openalex-snapshot
A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-46681-0_26openalex-snapshot
Approximate Counting in SMT and Value Estimation for Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_24openalex-snapshot
On the Hardness of Almost–Sure Termination
inferred← citeshttps://doi.org/10.1007/978-3-662-49498-1_15openalex-snapshot
Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-981-96-0602-3_2openalex-snapshot
An Assertion-Based Logic for Local Reasoning about Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/s00165-006-0004-5openalex-snapshot
Tank monitoring: a pAMN case study
inferred← citeshttps://doi.org/10.1007/s00165-007-0048-1openalex-snapshot
A unification of probabilistic choice within a design-based model of reversible computation
inferred← citeshttps://doi.org/10.1007/s00165-009-0111-1openalex-snapshot
Refinement algebra for probabilistic programs
inferred← citeshttps://doi.org/10.1007/s00165-010-0167-yopenalex-snapshot
Compositional noninterference from first principles
inferred← citeshttps://doi.org/10.1007/s00165-012-0227-6openalex-snapshot
Probabilistic verification of Herman’s self-stabilisation algorithm
inferred← citeshttps://doi.org/10.1007/s00165-012-0231-xopenalex-snapshot
Layered reasoning for randomized distributed algorithms
inferred← citeshttps://doi.org/10.1007/s00165-012-0236-5openalex-snapshot
Probabilistic may/must testing: retaining probabilities by restricted schedulers
inferred← citeshttps://doi.org/10.1007/s00165-012-0240-9openalex-snapshot
Towards a linear algebra of programming
inferred← citeshttps://doi.org/10.1007/s00165-012-0242-7openalex-snapshot
Exploring probabilistic bisimulations, part I
inferred← citeshttps://doi.org/10.1007/s00165-014-0305-zopenalex-snapshot
Integrating stochastic reasoning into Event-B development
inferred← citeshttps://doi.org/10.1007/s00236-008-0073-4openalex-snapshot
Algebraic reasoning for probabilistic action systems and while-loops
inferred← citeshttps://doi.org/10.1007/s00236-009-0100-0openalex-snapshot
Reasoning about faulty quantum programs
inferred← citeshttps://doi.org/10.1007/s00236-017-0297-2openalex-snapshot
Approximate counting in SMT and value estimation for probabilistic programs
inferred← citeshttps://doi.org/10.1007/s00236-018-0321-1openalex-snapshot
On the hardness of analyzing probabilistic programs
inferred← citeshttps://doi.org/10.1007/s10009-020-00603-xopenalex-snapshot
Verification of randomized consensus algorithms under round-rigid adversaries
inferred← citeshttps://doi.org/10.1007/s10270-017-0626-5openalex-snapshot
Introducing probabilistic reasoning within Event-B
inferred← citeshttps://doi.org/10.1007/s10626-023-00375-xopenalex-snapshot
Mixed Nondeterministic-Probabilistic Automata
inferred← citeshttps://doi.org/10.1007/s10703-010-0097-6openalex-snapshot
A game-based abstraction-refinement framework for Markov decision processes
inferred← citeshttps://doi.org/10.1007/s10703-019-00331-2openalex-snapshot
Quantitative static analysis of communication protocols using abstract Markov chains
inferred← citeshttps://doi.org/10.1007/s10703-024-00466-xopenalex-snapshot
Data-driven invariant learning for probabilistic programs
inferred← citeshttps://doi.org/10.1007/s10878-017-0146-9openalex-snapshot
The computational complexity of QoS measures for orchestrations
inferred← citeshttps://doi.org/10.1007/s11390-010-9407-0openalex-snapshot
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
inferred← citeshttps://doi.org/10.1007/s11460-007-0024-9openalex-snapshot
Topology, randomness and noise in process calculus
inferred← citeshttps://doi.org/10.1016/b978-0-12-802306-8.00004-5openalex-snapshot
Logic for quantum programs
inferred← citeshttps://doi.org/10.1016/b978-0-12-802306-8.00006-9openalex-snapshot
Quantum case statements
inferred← citeshttps://doi.org/10.1016/b978-0-44-315942-8.00016-2openalex-snapshot
Quantum Hoare logic
inferred← citeshttps://doi.org/10.1016/b978-0-44-315942-8.00024-1openalex-snapshot
Quantum case statements
inferred← citeshttps://doi.org/10.1016/j.apal.2008.06.020openalex-snapshot
A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language
inferred← citeshttps://doi.org/10.1016/j.cosrev.2020.100355openalex-snapshot
Modelling web-service uncertainty: The angel/daemon approach
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.01.021openalex-snapshot
Probabilistic Guarded Commands Mechanized in HOL
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.03.003openalex-snapshot
Memoryless Strategies for Stochastic Games via Domain Theory
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.04.031openalex-snapshot
Tank Monitoring: A pAMN Case Study
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.10.030openalex-snapshot
Quantitative Analysis With the Probabilistic Model Checker PRISM
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.10.039openalex-snapshot
A Novel Stochastic Game Via the Quantitative μ-calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.02.020openalex-snapshot
Refinement Algebra for Probabilistic Programs
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.08.006openalex-snapshot
Refinement Sensitive Formal Semantics of State Machines With Persistent Choice
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.12.021openalex-snapshot
How to Brew-up a Refinement Ordering
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.12.023openalex-snapshot
Data Refinement with Probability in Mind
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.02.005openalex-snapshot
A Virtual Machine for Supporting Reversible Probabilistic Guarded Command Languages
inferred← citeshttps://doi.org/10.1016/j.entcs.2015.12.013openalex-snapshot
Conditioning in Probabilistic Programming
inferred← citeshttps://doi.org/10.1016/j.entcs.2015.12.016openalex-snapshot
Healthiness Conditions for Predicate Transformers
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.09.016openalex-snapshot
A Denotational Semantics for Low-Level Probabilistic Programs with Nondeterminism
inferred← citeshttps://doi.org/10.1016/j.entcs.2020.09.002openalex-snapshot
Weakest Preconditions in Fibrations
inferred← citeshttps://doi.org/10.1016/j.ic.2013.12.003openalex-snapshot
Least upper bounds for probability measures and their applications to abstractions
inferred← citeshttps://doi.org/10.1016/j.ic.2016.02.009openalex-snapshot
The expectation monad in quantum foundations
inferred← citeshttps://doi.org/10.1016/j.ic.2019.05.004openalex-snapshot
Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104634openalex-snapshot
Time-bounded termination analysis for probabilistic programs with delays
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.12.013openalex-snapshot
An elementary proof that Herman's Ring is
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.03.003openalex-snapshot
Stepwise refinement of sequence diagrams with soft real-time constraints
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.11.007openalex-snapshot
“Keep definition, change category” — A practical approach to state-based system calculi
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.04.002openalex-snapshot
Program algebra for quantitative information flow
inferred← citeshttps://doi.org/10.1016/j.jlamp.2025.101094openalex-snapshot
On the inner structure of multirelations
inferred← citeshttps://doi.org/10.1016/j.jlap.2007.10.005openalex-snapshot
Using probabilistic Kleene algebra pKA for protocol verification
inferred← citeshttps://doi.org/10.1016/j.jlap.2011.06.001openalex-snapshot
Generating counterexamples for quantitative safety specifications in probabilistic B
inferred← citeshttps://doi.org/10.1016/j.jlap.2014.02.014openalex-snapshot
Relations into algebras of probabilistic distributions
inferred← citeshttps://doi.org/10.1016/j.knosys.2020.105976openalex-snapshot
Abstracting probabilistic models: Relations, constraints and beyond
inferred← citeshttps://doi.org/10.1016/j.scico.2007.09.002openalex-snapshot
Proofs of randomized algorithms in Coq
inferred← citeshttps://doi.org/10.1016/j.scico.2007.09.003openalex-snapshot
The Shadow Knows: Refinement and security in sequential programs
inferred← citeshttps://doi.org/10.1016/j.scico.2013.08.006openalex-snapshot
Reasoning about almost-certain convergence properties using Event-B
inferred← citeshttps://doi.org/10.1016/j.scico.2013.09.003openalex-snapshot
An old new notation for elementary probability theory
inferred← citeshttps://doi.org/10.1016/j.scico.2015.04.008openalex-snapshot
A study of risk-aware program transformation
inferred← citeshttps://doi.org/10.1016/j.scico.2017.05.008openalex-snapshot
Formal reasoning about resilient goal-oriented multi-agent systems
inferred← citeshttps://doi.org/10.1016/j.scico.2020.102404openalex-snapshot
Automated urban train control with hybrid Event-B: ‘Tackling’ the rugby club problem
inferred← citeshttps://doi.org/10.1016/j.scico.2022.102822openalex-snapshot
Slicing of probabilistic programs based on specifications
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.06.011openalex-snapshot
Proof rules for the correctness of quantum programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.029openalex-snapshot
Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.12.021openalex-snapshot
Moment-based analysis of Bayesian network properties
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.02.017openalex-snapshot
Formal semantics of a classical-quantum language
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114876openalex-snapshot
Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: Semantics and automated reasoning with theorem proving
inferred← citeshttps://doi.org/10.1017/9781108770750.007openalex-snapshot
Expected Runtime Analyis by Program Verification
inferred← citeshttps://doi.org/10.1017/9781108770750.008openalex-snapshot
Termination Analysis of Probabilistic Programs with Martingales
inferred← citeshttps://doi.org/10.1017/9781108770750.009openalex-snapshot
Quantitative Analysis of Programs with Probabilities and Concentration of Measure Inequalities
inferred← citeshttps://doi.org/10.1017/9781108770750.013openalex-snapshot
Quantitative Information Flow with Monads in Haskell
inferred← citeshttps://doi.org/10.1017/s0956796821000137openalex-snapshot
A trustful monad for axiomatic reasoning with probability and nondeterminism
inferred← citeshttps://doi.org/10.1017/s0960129506005251openalex-snapshot
Quantum weakest preconditions
inferred← citeshttps://doi.org/10.1017/s0960129509007555openalex-snapshot
Predicate transformers for extended probability and non-determinism
inferred← citeshttps://doi.org/10.1017/s0960129522000330openalex-snapshot
Weakest preconditions in fibrations
showing the first 200 of 339 · page through all 339
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.