Sciweavers

977 search results - page 155 / 196
» Formal methods integration in software engineering
Sort
View
SIAMCOMP
2011
14 years 6 months ago
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
SIAMCOMP
2011
14 years 6 months ago
An Expansion Tester for Bounded Degree Graphs
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...
Satyen Kale, C. Seshadhri
147
Voted
SFM
2009
Springer
150views Formal Methods» more  SFM 2009»
15 years 10 months ago
Contract-Based Discovery and Composition of Web Services
In the context of Service Oriented Computing behavioural contracts are descriptions of the observable message-passing behaviour of services. In other terms, contracts are behaviour...
Mario Bravetti, Gianluigi Zavattaro
ISSRE
2003
IEEE
15 years 9 months ago
Requirements by Contracts allow Automated System Testing
Use-cases and scenarios have been identified as good inputs to generate test cases and oracles at requirement level. Yet to have an automated generation, information is missing f...
Clémentine Nebut, Franck Fleurey, Yves Le T...
TCBB
2011
14 years 11 months ago
Data Mining on DNA Sequences of Hepatitis B Virus
: Extraction of meaningful information from large experimental datasets is a key element of bioinformatics research. One of the challenges is to identify genomic markers in Hepatit...
Kwong-Sak Leung, Kin-Hong Lee, Jin Feng Wang, Eddi...