56 search results - page 5 / 12 » The Complexity of Model Checking Higher Order Fixpoint Logic |
LFCS
2007
Springer
14 years 5 months ago
2007
Springer
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
CHARME
2003
Springer
14 years 4 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
LICS
1998
IEEE
14 years 3 months ago
1998
IEEE
d abstract) T. Eiter G. Gottlob Y. Gurevich Institut fur Informatik Institut fur Informationssysteme EECS Department Universitat Gie en Technische Universitat Wien University of Mi...
CAV
2004
Springer
14 years 2 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
CONCUR
1999
Springer
14 years 3 months ago
1999
Springer
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...