6608 search results - page 248 / 1322 » On the Completeness of Model Checking |
188
click to vote
ESORICS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Formal methods have been extensively applied to the certification of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e....
137
click to vote
CAISE
2003
Springer
15 years 11 months ago
2003
Springer
In this paper we discuss how the concept of ontology can be beneficial for the authoring support of Web-based educational systems (WBES). We take a semantic perspective on the know...
179
click to vote
AAAI
2006
15 years 7 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
149
click to vote
CEC
2008
IEEE
16 years 11 days ago
2008
IEEE
Abstract— Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most o...
142
click to vote
ECCV
2000
Springer
16 years 7 months ago
2000
Springer
We describe a method for computing the likelihood that a completion joining two contour fragments passes through any given position and orientation in the image plane, that is, a m...