Sciweavers

6149 search results - page 431 / 1230
» Revealing the programming process
Sort
View
BMCBI
2006
101views more  BMCBI 2006»
15 years 7 months ago
How repetitive are genomes?
Background: Genome sequences vary strongly in their repetitiveness and the causes for this are still debated. Here we propose a novel measure of genome repetitiveness, the index o...
Bernhard Haubold, Thomas Wiehe
JSS
2011
103views more  JSS 2011»
14 years 9 months ago
XML-manipulating test case prioritization for XML-manipulating services
: A web service may evolve autonomously, making peer web services in the same service composition uncertain as to whether the evolved behaviors are compatible with its original col...
Lijun Mei, W. K. Chan, T. H. Tse, Robert G. Merkel
SEUS
2009
IEEE
16 years 1 months ago
Concurrency and Communication: Lessons from the SHIM Project
Abstract. Describing parallel hardware and software is difficult, especially in an embedded setting. Five years ago, we started the shim project to address this challenge by develo...
Stephen A. Edwards
FM
2009
Springer
124views Formal Methods» more  FM 2009»
16 years 1 months ago
Reasoning about Memory Layouts
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
Holger Gast
HASKELL
2009
ACM
16 years 1 months ago
Type-safe observable sharing in Haskell
Haskell is a great language for writing and supporting embedded Domain Specific Languages (DSLs). Some form of observable sharing is often a critical capability for allowing so-c...
Andy Gill