402 search results - page 50 / 81 » Model Checking Quantified Computation Tree Logic |
DFG
2004
Springer
14 years 2 months ago
2004
Springer
This paper presents the real-time model checker RAVEN and related theoretical background. RAVEN augments the efficiency of traditional symbolic model checking with possibilities to...
ESOP
2008
Springer
14 years 23 days ago
2008
Springer
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
DAC
1993
ACM
14 years 3 months ago
1993
ACM
We present an efficient and effective method for the detailed routing of symmetrical or sea-of-gates FPGA architectures. Instead of breaking the problem into 2-terminal net collec...
CSCLP
2008
Springer
14 years 24 days ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
LOGCOM
2010
13 years 9 months ago
2010
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...