309 search results - page 35 / 62 » Model Checking Games for Branching Time Logics |
GLVLSI
2009
IEEE
15 years 6 months ago
2009
IEEE
In the context of formal verification Bounded Model Checking (BMC) has shown to be very powerful for large industrial designs. BMC is used to check whether a circuit satisfies a...
KBSE
2009
IEEE
15 years 6 months ago
2009
IEEE
Propositional bounded model checking has been applied successfully to verify embedded software but is limited by the increasing propositional formula size and the loss of structur...
WOA
2007
15 years 28 days ago
2007
Abstract—In this work, we present a constrained-based representation for specifying the goals of “course design”, that we call curricula model, and introduce a graphical lang...
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper investigates a complexity-effective technique for verifying a highly distributed directory-based cache coherence protocol. We develop a novel approach called “witnes...
ENTCS
2002
14 years 11 months ago
2002
We investigate a variant of dense-time Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Du...