Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Probabilistic models for the guarded command language
Science of Computer Programming - Special issue: on formal specifications: foundations, methods, tools and applications: selected papers from the FMTA '95 conference (29–31 May 1995, Konstancin n. Warsaw, Poland)
A Discipline of Programming
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Proofs and Refutations for Probabilistic Refinement
FM '08 Proceedings of the 15th international symposium on Formal Methods
Probabilistic Guarded Commands Mechanized in HOL
Electronic Notes in Theoretical Computer Science (ENTCS)
Scalar outcomes suffice for finitary probabilistic testing
ESOP'07 Proceedings of the 16th European conference on Programming
Counterexamples in probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Automating refinement checking in probabilistic system design
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
A fast linear-arithmetic solver for DPLL(T)
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Proofs and Refutations for Probabilistic Refinement
FM '08 Proceedings of the 15th international symposium on Formal Methods
Security, Probability and Nearly Fair Coins in the Cryptographers' Café
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Performance evaluation and model checking join forces
Communications of the ACM
| Hi-index | 0.02 |
We consider the issue of finding and presenting counterexamples to a claim "this specis implemented by that imp", that is $\textit{spec} \sqsubseteq \textit{imp}$ (refinement), in the context of probabilisticsystems: using a geometric interpretation of the probabilistic/demonic semantic domain we are able to encode both refinement success and refinement failure as linear satisfaction problems, which can then be analysed automatically by an SMT solver. This allows the automatic discovery of certificates for counterexamples in independently and efficiently checkable form. In many cases the counterexamples can subsequently be converted into "source level" hints for the verifier.