6608 search results - page 69 / 1322 » On the Completeness of Model Checking |
135
click to vote
STTT
2010
14 years 10 months ago
2010
Abstract. We report here on an experimental investigation of LTL satisfiability checking via a reduction to model checking. By using large LTL formulas, we offer challenging model-...
135
click to vote
ICFEM
2004
Springer
15 years 9 months ago
2004
Springer
d Abstract) Carsten Sinz and Wolfgang K¨uchlin Symbolic Computation Group, WSI for Computer Science, University of T¨ubingen and Steinbeis Technology Transfer Center OIT, 72076 T...
124
click to vote
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
129
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We present an iterative algorithm for enforcing policies represented in a first-order logic, which can, in particular, express all transmission-related clauses in the HIPAA Priva...