309 search results - page 31 / 62 » Model Checking Games for Branching Time Logics |
107
click to vote
GLVLSI
2006
IEEE
15 years 7 months ago
2006
IEEE
Functional verification is one of the major bottlenecks in microprocessor design. Simulation-based techniques are the most widely used form of processor verification. Efficient ...
122
click to vote
CONCUR
2000
Springer
15 years 5 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
117
click to vote
CSL
2009
Springer
15 years 5 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
119
click to vote
ICFEM
2009
Springer
14 years 11 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
128
click to vote
ENTCS
2007
15 years 1 months ago
2007
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...