A randomized protocol for signing contracts
Communications of the ACM
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Symmetry breaking in distributed networks
Information and Computation
Self-stabilizing depth-first search
Information Processing Letters
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Bounded Model Checking Using Satisfiability Solving
Formal Methods in System Design
Analysis of probabilistic contract signing
Journal of Computer Security
Signature-based Symbolic Algorithm for Optimal Markov Chain Lumping
QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Counterexample Generation in Probabilistic Model Checking
IEEE Transactions on Software Engineering
Significant Diagnostic Counterexamples in Probabilistic Model Checking
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
IEEE Transactions on Software Engineering
Counterexamples in probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Bisimulation minimisation mostly speeds up probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Proceedings of the First Workshop on DYnamic Aspects in DEpendability Models for Fault-Tolerant Systems
Symbolic partition refinement with automatic balancing of time and space
Performance Evaluation
DTMC Model Checking by SCC Reduction
QEST '10 Proceedings of the 2010 Seventh International Conference on the Quantitative Evaluation of Systems
A fast linear-arithmetic solver for DPLL(T)
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.02 |
Generation of counterexamples is a highly important task in the model checking process. In contrast to, e. g., digital circuits where counterexamples typically consist of a single path leading to a critical state of the system, in the probabilistic setting counterexamples may consist of a large number of paths. In order to be able to handle large systems and to use the capabilities of modern SAT-solvers, bounded model checking (BMC) for discrete-time Markov chains was established. In this paper we introduce the usage of SMT-solving over linear real arithmetic for the BMC procedure. SMT-solving, extending SAT with theories in this context on the one hand leads to a convenient way to express conditions on the probability of certain paths and on the other hand allows to handle Markov reward models. We use the former to find paths with high probability first. This leads to more compact counterexamples. We report on some experiments, which show promising results.