402 search results - page 46 / 81 » Model Checking Quantified Computation Tree Logic |
AGP
2003
IEEE
14 years 4 months ago
2003
IEEE
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assu...
CAV
2004
Springer
14 years 2 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
APAL
2007
13 years 11 months ago
2007
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
CORR
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
CAV
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We present the tool MERIT, a CEGAR model-checker for safety propf counter-systems, which sits in the Lazy Abstraction with Interpolants (LAWI) framework. LAWI is parametr...