APEX: An analyzer for open probabilistic programs

APEX: An analyzer for open probabilistic programs

We present APEX, a tool for analysing probabilistic programs that are open, i.e. where variables or even functions can be left unspecified. APEX transforms a program into an automaton that captures the program's probabilistic behaviour under all instantiations of the unspecified components. The...

Полное описание

Библиографические подробности
Главные авторы:	Kiefer, S, Murawski, A, Ouaknine, J, Wachter, B, Worrell, J
Формат:	Journal article
Язык:	English
Опубликовано:	2012

Схожие документы

Language equivalence for probabilistic automata
по: Kiefer, S, и др.
Опубликовано: (2011)

Algorithmic probabilistic game semantics
по: Kiefer, S, и др.
Опубликовано: (2013)

On the Complexity of the Equivalence Problem for Probabilistic Automata
по: Kiefer, S, и др.
Опубликовано: (2012)

On automated verification of probabilistic programs
по: Legay, A, и др.
Опубликовано: (2008)

Three tokens in Herman's algorithm
по: Kiefer, S, и др.
Опубликовано: (2012)

ON THE COMPLEXITY OF EQUIVALENCE AND MINIMISATION FOR Q-WEIGHTED AUTOMATA
по: Kiefer, S, и др.
Опубликовано: (2013)

On the Complexity of Equivalence and Minimisation for Q-weighted Automata
по: Stefan Kiefer, и др.
Опубликовано: (2013-03-01)

On stabilization in Herman's algorithm
по: Kiefer, S, и др.
Опубликовано: (2011)

Game characterization of probabilistic bisimilarity, and applications to pushdown automata
по: Forejt, V, и др.
Опубликовано: (2018)

Open apex solutions: One-step apexification, salvaging necrosed teeth with open apex
по: Sunandan Mittal Kumar, и др.
Опубликовано: (2019-01-01)

On ranking function synthesis and termination for polynomial programs
по: Neumann, E, и др.
Опубликовано: (2020)

PENERIMA PROGRAM APEX SCHOLAR MENJADI KAYU UKUR KEBERHASILAN PROGRAM APEX
по: MPRC, Pusat Media & Perhubungan Awam
Опубликовано: (2016)

On strongest algebraic program invariants
по: Hrushovski, E, и др.
Опубликовано: (2023)

Polynomial invariants for affine programs
по: Hrushovski, E, и др.
Опубликовано: (2018)

Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata
по: Vojtěch Forejt, и др.
Опубликовано: (2018-11-01)

Proving the Herman-Protocol Conjecture
по: Bruna, M, и др.
Опубликовано: (2016)

Guaranteed bounds on posterior distributions of discrete probabilistic programs with loops
по: Zaiser, F, и др.
Опубликовано: (2025)

Parameter synthesis for parametric probabilistic dynamical systems and prefix-independent specifications
по: Baier, C, и др.
Опубликовано: (2022)

Refined Probabilistic Abstraction
по: Wachter, B
Опубликовано: (2010)

Language Equivalence for Probabilistic Automata
по: Wachter, J
Опубликовано: (2011)

Open apex and its management: Review article
по: Ikroop Gill, и др.
Опубликовано: (2024-01-01)

Measuring the probabilistic powerdomain
по: Martin, K, и др.
Опубликовано: (2002)

Measuring the probabilistic powerdomain
по: Martin, K, и др.
Опубликовано: (2002)

Best Probabilistic Transformers
по: Wachter, B, и др.
Опубликовано: (2010)

Decision Problems for Linear Recurrence Sequences.
по: Ouaknine, J, и др.
Опубликовано: (2012)

On metric temporal logic and faulty turing machines
по: Ouaknine, J, и др.
Опубликовано: (2006)

Some Recent Results in Metric Temporal Logic
по: Ouaknine, J, и др.
Опубликовано: (2008)

Towards a Theory of Time-Bounded Verification.
по: Ouaknine, J, и др.
Опубликовано: (2010)

Safety metric temporal logic is fully decidable
по: Ouaknine, J, и др.
Опубликовано: (2006)

ON THE DECIDABILITY AND COMPLEXITY OF METRIC TEMPORAL LOGIC OVER FINITE WORDS
по: Ouaknine, J, и др.
Опубликовано: (2007)

Probabilistic CEGAR
по: Hermanns, H, и др.
Опубликовано: (2008)

Probabilistic automata of bounded ambiguity
по: Fijalkow, N, и др.
Опубликовано: (2017)

Apex - Criteria For Apex Varsity Selection.
по: The Star, Online
Опубликовано: (2008)

Apex - USM Gets Apex Status.
по: The Star, Online
Опубликовано: (2008)

Apex - Cadangan Tubuh Universiti Apex.
по: Utusan, Malaysia
Опубликовано: (2008)

Apexification of a dens evaginated premolar with open apex
по: Hamid Jafarzadeh, и др.
Опубликовано: (2015-02-01)

Convex language semantics for nondeterministic probabilistic automata
по: Van Heerdt, G, и др.
Опубликовано: (2018)

On the Complexity of Computing Probabilistic Bisimilarity
по: Chen, D, и др.
Опубликовано: (2012)

Exact Bayesian inference on discrete models via probability generating functions: a probabilistic programming approach
по: Zaiser, F, и др.
Опубликовано: (2024)

Undecidability of universality for timed automata with minimal resources
по: Adams, S, и др.
Опубликовано: (2007)