244 search results - page 43 / 49 » Counterexamples in Probabilistic Model Checking |
CADE
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
SIGSOFT
2005
ACM
15 years 10 months ago
2005
ACM
Growing attention is being paid to application security at requirements engineering time. Confidentiality is a particular subclass of security concerns that requires sensitive inf...
105
click to vote
CADE
2008
Springer
15 years 9 months ago
2008
Springer
Many safety- and security-critical systems are real-time systems and, as a result, tools and techniques for verifying real-time systems are extremely important. Simulation and test...
72
Voted
TCS
2002
14 years 9 months ago
2002
We consider the timed automata model of [3], which allows the analysis of realtime systems expressed in terms of quantitative timing constraints. Traditional approaches to real-ti...
136
click to vote
CSCLP
2008
Springer
14 years 11 months ago
2008
Springer
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such for...