39 citations · 92 across the 17 of their papers we have counts for
8 papers · 1 filter
On the proof complexity of MCSAT
Gereon Kremer, Erika Abraham, Vijay Ganesh
Satisfiability Modulo Theories (SMT) and SAT solvers are critical components in many formal software tools, primarily due to the fact that they are able to easily solve logical pro…
Proving UNSAT in SMT: The Case of Quantifier Free Non-Linear Real Arithmetic
Erika Abraham, James H. Davenport, Matthew England +1
We discuss the topic of unsatisfiability proofs in SMT, particularly with reference to quantifier free non-linear real arithmetic. We outline how the methods here do not admit triv…
Probabilistic Hyperproperties with Nondeterminism
Erika Abraham, Ezio Bartocci, Borzoo Bonakdarpour +1
We study the problem of formalizing and checking probabilistic hyperproperties for models that allow nondeterminism in actions. We extend the temporal logic \HyperPCTL, which has b…
Multiple Analyses, Requirements Once: simplifying testing & verification in automotive model-based development
Philipp Berger, Johanna Nellen, Joost-Pieter Katoen +3
In industrial model-based development (MBD) frameworks, requirements are typically specified informally using textual descriptions. To enable the application of formal methods, the…
Parameter Synthesis for Markov Models: Covering the Parameter Space
Sebastian Junges, Erika Ábrahám, Christian Hensel +4
Markov chain analysis is a key technique in formal verification. A practical obstacle is that all probabilities in Markov models need to be known. However, system quantities such a…
HyperPCTL: A Temporal Logic for Probabilistic Hyperproperties
Erika Abraham, Borzoo Bonakdarpour
In this paper, we propose a new logic for expressing and reasoning about probabilistic hyperproperties. Hyperproperties characterize the relation between different independent exec…