Predicative programming Part II
Communications of the ACM
A machine program for theorem-proving
Communications of the ACM
Stochastic Boolean Satisfiability
Journal of Automated Reasoning
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Towars a Theory of Stochastic Hybrid Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
HySAT: An efficient proof engine for bounded model checking of hybrid systems
Formal Methods in System Design
On the stochastic constraint satisfaction framework
Proceedings of the 2007 ACM symposium on Applied computing
Verifying Industrial Hybrid Systems with MathSAT
Electronic Notes in Theoretical Computer Science (ENTCS)
Reachability questions in piecewise deterministic Markov processes
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Computational methods for reachability analysis of stochastic hybrid systems
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
A fast linear-arithmetic solver for DPLL(T)
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Polynomial stochastic hybrid systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Continuous time and/or continuous distributions
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Resolution for stochastic Boolean satisfiability
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Satisfaction meets expectations: computing expected values of probabilistic hybrid systems with SMT
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Generalized craig interpolation for stochastic boolean satisfiability problems
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Safety verification for probabilistic hybrid systems
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
| Hi-index | 0.00 |
The analysis of hybrid systems exhibiting probabilistic behaviour is notoriously difficult. To enable mechanised analysis of such systems, we extend the reasoning power of arithmetic satisfiability-modulo-theory solving (SMT) by a comprehensive treatment of randomized (a.k.a. stochastic) quantification over discrete variables within the mixed Boolean-arithmetic constraint system. This provides the technological basis for a fully symbolic analysis of probabilistic hybrid automata. Generalizing SMT-based bounded model-checking of hybrid automata [2,11], stochastic SMT permits the direct and fully symbolic analysis of probabilistic bounded reachability problems of probabilistic hybrid automata without resorting to approximation by intermediate finite-state abstractions.