125 search results - page 14 / 25 » Computing Over-Approximations with Bounded Model Checking |
82
Voted
QEST
2007
IEEE
15 years 3 months ago
2007
IEEE
Stochastic game logic (SGL) is a new temporal logic that combines features of alternating temporal logic (to formalize the individual views and cooperation and reaction facilities...
CHARME
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
86
Voted
CONCUR
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
ISSTA
2010
ACM
14 years 11 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
90
Voted
PRDC
2002
IEEE
15 years 2 months ago
2002
IEEE
Feature interaction is a kind of inconsistent conflict between multiple communication services and considered an obstacle to developing reliable telephony systems. In this paper ...