12981 search results - page 125 / 2597 » Model Checking and Abstraction |
123
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
136
click to vote
SPIN
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Context-Bounded Analysis has emerged as a practical automatic formal analysis technique for fine-grained, shared-memory concurrent software. Two recent papers (in CAV 20...
147
click to vote
ICECCS
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—Transactional Memory (TM) is a promising technique that addresses the difficulty of parallel programming. Since TM takes responsibility for all concurrency control, TM ...
163
click to vote
DLOG
2009
15 years 2 months ago
2009
Abstract. Model-based most specific concepts are a non-standard reasoning service in Description Logics. They have turned out to be useful in knowledge base completion for ontologi...
153
click to vote
CONCUR
2001
Springer
15 years 9 months ago
2001
Springer
Bounded model checking has been recently introduced as an efficient verification method for reactive systems. In this work we apply bounded model checking to asynchronous systems....