43 citations · 170 across the 19 of their papers we have counts for
4 papers · 1 filter
Automated Termination Analysis of Polynomial Probabilistic Programs
Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen +1
The termination behavior of probabilistic programs depends on the outcomes of random assignments. Almost sure termination (AST) is concerned with the question whether a program ter…
Analysis of Bayesian Networks via Prob-Solvable Loops
Ezio Bartocci, Laura Kovács, Miroslav Stankovič
Prob-solvable loops are probabilistic programs with polynomial assignments over random variables and parametrised distributions, for which the full automation of moment-based invar…
Subsumption Demodulation in First-Order Theorem Proving
Bernhard Gleiss, Laura Kovacs, Jakob Rath
Motivated by applications of first-order theorem proving to software analysis, we introduce a new inference rule, called subsumption demodulation, to improve support for reasoning…
Interactive Visualization of Saturation Attempts in Vampire
Bernhard Gleiss, Laura Kovacs, Lena Schnedlitz
Many applications of formal methods require automated reasoning about system properties, such as system safety and security. To improve the performance of automated reasoning engin…