729 search results - page 41 / 146 » A Transitive Closure Based Algorithm for Test Generation |
RE
1999
Springer
13 years 12 months ago
1999
Springer
Requirements capture by scenarios and user interface prototyping have become popular techniques. Yet, the transition from scenarios to formal specifications is still ill-defined, ...
JAIR
2010
13 years 6 months ago
2010
Model-based diagnostic reasoning often leads to a large number of diagnostic hypotheses. The set of diagnoses can be reduced by taking into account extra observations (passive mon...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
CPAIOR
2010
Springer
13 years 11 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
ATVA
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. In the traditional Boolean setting of formal verification, alternating automata are the key to many algorithms and tools. In this setting, the correspondence between dis...