713 search results - page 5 / 143 » Model Checking and Transitive-Closure Logic |
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
CADE
2000
Springer
13 years 11 months ago
2000
Springer
MOVEP
2000
13 years 11 months ago
2000
We survey principles of model checking techniques for the automatic analysis of reactive systems. The use of model checking is exemplified by an analysis of the Needham-Schroeder p...
LICS
2005
IEEE
14 years 1 months ago
2005
IEEE
Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions g...