1138 search results - page 77 / 228 » First-Order Model Checking Problems Parameterized by the Mod... |
IANDC
2011
13 years 2 months ago
2011
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
PODS
1994
ACM
13 years 12 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
FMICS
2007
Springer
14 years 2 months ago
2007
Springer
Using PVS (Prototype Verification System), we prove that an industry designed scheduler for a smartcard personalization machine is safe and optimal. This scheduler has previously ...
WWW
2006
ACM
14 years 8 months ago
2006
ACM
The need of formal verification is a problem that involves all the fields in which sensible data are managed. In this context the verification of data streams became a fundamental...
ISI
2006
Springer
13 years 7 months ago
2006
Springer
We present an overview of our work in information fusion for intelligence analysis. This work includes the Hats Simulator and the COLAB system. The Hats Simulator is a parameterize...