Sciweavers

1242 search results - page 201 / 249
» Benchmark Analysis with FaCT
Sort
View
FMCAD
2000
Springer
13 years 11 months ago
Automated Refinement Checking for Asynchronous Processes
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
Rajeev Alur, Radu Grosu, Bow-Yaw Wang
FPCA
1995
13 years 11 months ago
How Much Non-Strictness do Lenient Programs Require?
Lenient languages, such as Id90, have been touted as among the best functional languages for massively parallel machines AHN88]. Lenient evaluation combines non-strict semantics w...
Klaus E. Schauser, Seth Copen Goldstein
AAAI
2008
13 years 10 months ago
Computing Observation Vectors for Max-Fault Min-Cardinality Diagnoses
Model-Based Diagnosis (MBD) typically focuses on diagnoses, minimal under some minimality criterion, e.g., the minimal-cardinality set of faulty components that explain an observa...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...
ATVA
2008
Springer
102views Hardware» more  ATVA 2008»
13 years 9 months ago
Time-Progress Evaluation for Dense-Time Automata with Concave Path Conditions
The evaluation of successor or predecessor state spaces through time progress is a central component in the model-checking algorithm of dense-time automata. The definition of the t...
Farn Wang
CIKM
2008
Springer
13 years 9 months ago
The role of syntactic features in protein interaction extraction
Most approaches for protein interaction mining from biomedical texts use both lexical and syntactic features. However, the individual impact of these two kinds of features on the ...
Timur Fayruzov, Martine De Cock, Chris Cornelis, V...