798 search results - page 80 / 160 » Proving More Properties with Bounded Model Checking |
WG
1998
Springer
13 years 12 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
FOSSACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
BMCBI
2006
13 years 7 months ago
2006
Background: The identification of statistically overrepresented sequences in the upstream regions of coregulated genes should theoretically permit the identification of potential ...
TPHOL
2009
IEEE
14 years 2 months ago
2009
IEEE
Traditional security protocols are mainly concerned with key establishment and principal authentication and rely on predistributed keys and properties of cryptographic operators. I...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...