125 search results - page 13 / 25 » Computing Over-Approximations with Bounded Model Checking |
EUROCAST
2007
Springer
13 years 11 months ago
2007
Springer
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...
CAV
2004
Springer
14 years 1 months ago
2004
Springer
Regular Tree Model Checking Ahmed Bouajjani, Peter Habermehl 1 LIAFA, University Paris 7, Case 7014, 2, place Jussieu, F-75251 Paris Cedex 05, France Adam Rogalewicz, Tom´aˇs Voj...
TACAS
2007
Springer
14 years 1 months ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
ICALP
1994
Springer
13 years 11 months ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
VMCAI
2010
Springer
14 years 5 months ago
2010
Springer
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...