6608 search results - page 25 / 1322 » On the Completeness of Model Checking |
81
Voted
FBT
2000
15 years 2 months ago
2000
102
Voted
CADE
2006
Springer
15 years 4 months ago
2006
Springer
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...
69
Voted
ACSD
2006
IEEE
15 years 6 months ago
2006
IEEE
Signal Transition Graphs (STGs) are a popular formalism for the specification of asynchronous circuits. A necessary condition for the implementability of an STG is the existence ...
127
click to vote
GVD
2004
15 years 2 months ago
2004
We investigate classes of SQL queries which are syntactically correct, but certainly not intended, no matter for which task the query was written. For instance, queries that are c...
93
Voted
IPL
2006
15 years 20 days ago
2006
Knuth-Bendix completions of the equational theories of k 2 commuting group endomorphisms are obtained, using automated theorem proving and modern termination checking. This impro...