616 search results - page 13 / 124 » Bounded Model Checking with Description Logic Reasoning |
MEMOCODE
2005
IEEE
14 years 2 months ago
2005
IEEE
In principle, bounded model checking (BMC) leads to semidecision procedures that can be used to verify liveness properties and to falsify safety properties. If the procedures fail...
CSL
2004
Springer
13 years 8 months ago
2004
Springer
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of -regular languages. The class has two equivalent descrip...
ER
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs:...
SIGSOFT
2007
ACM
14 years 9 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
CADE
2007
Springer
14 years 9 months ago
2007
Springer
