The refinement calculus is a well-established theory for translating specifications to program code. Recent research has extended the calculus to handle real-time requirements and...
Background: Many programs have been developed to identify transcription factor binding sites. However, most of them are not able to infer two-word motifs with variable spacer leng...
Fabrice Touzain, Sophie Schbath, Isabelle Debled-R...
We present a case study of an international distance education course involving two sites in the US and one site in Pakistan. We use the case study to examine the elements of the ...
Richard J. Anderson, Ruth E. Anderson, Natalie Lin...
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
We discuss the problem of generating test suites from UML state machines and present a method to extend the capabilities of existing automated test case generators. Current tools p...