Sciweavers

2 search results - page 1 / 1
» Precise Interval Analysis vs. Parity Games
Sort
View
FM
2008
Springer
148views Formal Methods» more  FM 2008»
13 years 5 months ago
Precise Interval Analysis vs. Parity Games
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
Thomas Gawlitza, Helmut Seidl
JSS
2006
127views more  JSS 2006»
13 years 4 months ago
An approach to feature location in distributed systems
This paper describes an approach to the feature location problem for distributed systems, that is, to the problem of locating which code components are important in providing a pa...
Dennis Edwards, Sharon Simmons, Norman Wilde