6608 search results - page 34 / 1322 » On the Completeness of Model Checking |
ENTCS
2006
15 years 22 days ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
115
Voted
STACS
2007
Springer
15 years 6 months ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
90
Voted
FSTTCS
2004
Springer
15 years 6 months ago
2004
Springer
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
MVA
1994
15 years 2 months ago
1994
The visual perceptional ability of computer systems to understand the environment is desirable in engineering design and manufacturing where automation is anticipated. I n order t...
105
Voted
CORR
2010
Springer
15 years 24 days ago
2010
Springer
Let a, b and n be nonnegative integers (b a, b > 0, n 1), Gn(a, b) be a multigraph on n vertices in which any pair of vertices is connected with at least a and at most b edges ...