Sciweavers

3928 search results - page 38 / 786
» order 2006
Sort
View
IANDC
2007
133views more  IANDC 2007»
13 years 9 months ago
On decidability of monadic logic of order over the naturals extended by monadic predicates
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
Alexander Rabinovich
IEICET
2007
110views more  IEICET 2007»
13 years 9 months ago
A Higher-Order Knuth-Bendix Procedure and Its Applications
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
Keiichirou Kusakari, Yuki Chiba
FMSD
2002
107views more  FMSD 2002»
13 years 9 months ago
Verification of Out-Of-Order Processor Designs Using Model Checking and a Light-Weight Completion Function
We present a new technique for verification of complex hardware devices that allows both generality andahighdegreeofautomation.Thetechniqueisbasedonournewwayofconstructinga"li...
Sergey Berezin, Edmund M. Clarke, Armin Biere, Yun...
JSYML
2002
170views more  JSYML 2002»
13 years 9 months ago
Representability in Second-Order Propositional Poly-Modal Logic
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
Gian Aldo Antonelli, Richmond H. Thomason
IOR
2010
90views more  IOR 2010»
13 years 8 months ago
No-Holdback Allocation Rules for Continuous-Time Assemble-to-Order Systems
This paper analyzes a class of common-component allocation rules, termed no-holdback (NHB) rules, in continuous-review assemble-to-order (ATO) systems. We assume that component in...
Yingdong Lu, Jing-Sheng Song, Yao Zhao