2878 search results - page 567 / 576 » Model Checking FTA |
WETICE
2000
IEEE
14 years 1 months ago
2000
IEEE
This paper presents joint work by the California Institute of Technology’s Jet Propulsion Laboratory and the University of California at Davis (UC Davis) sponsored by the Nation...
DEXA
1999
Springer
14 years 27 days ago
1999
Springer
: In an extensible database system, evaluation of a query plan is done in cooperation between a collection of operator implementation functions and a component of the DBMS that we ...
ESEC
1999
Springer
14 years 27 days ago
1999
Springer
The use of smart cards to run software modules on demand has become a major business concern for application issuers. Such downloadable executable content requires to be trusted by...
ICALP
1998
Springer
14 years 25 days ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
PODS
1994
ACM
14 years 21 days 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 {...