175 search results - page 31 / 35 » The Complexity of Model Checking Higher-Order Fixpoint Logic |
103
click to vote
NGITS
1999
Springer
15 years 1 months ago
1999
Springer
As the requirements for system analysis and design become more complex, the need for a natural, yet formal way of specifying system analysis findings and design decisions are becom...
DAC
2006
ACM
15 years 10 months ago
2006
ACM
Ever-growing complexity is forcing design to move above RTL. For example, golden functional models are being written as clearly as possible in software and not optimized or intend...
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
104
click to vote
ICCAD
1999
IEEE
15 years 1 months ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
OTM
2005
Springer
15 years 3 months ago
2005
Springer
We propose to enhance a schema integration process with a validation phase employing logic-based data models. In our methodology, we validate the source schemas against the data mo...