Sciweavers

104 search results - page 12 / 21
» Polymorphing Software by Randomizing Data Structure Layout
Sort
View
BMCBI
2010
154views more  BMCBI 2010»
13 years 8 months ago
An algorithm for automated closure during assembly
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
Sergey Koren, Jason R. Miller, Brian Walenz, Grang...
ICSE
2007
IEEE-ACM
14 years 8 months ago
Feedback-Directed Random Test Generation
We present a technique that improves random test generation by incorporating feedback obtained from executing test inputs as they are created. Our technique builds inputs incremen...
Carlos Pacheco, Shuvendu K. Lahiri, Michael D. Ern...
ERLANG
2008
ACM
13 years 10 months ago
Testing Erlang data types with quviq quickcheck
When creating software, data types are the basic bricks. Most of the time a programmer will use data types defined in library modules, therefore being tested by many users over ma...
Thomas Arts, Laura M. Castro, John Hughes
VL
1992
IEEE
135views Visual Languages» more  VL 1992»
14 years 19 days ago
Tidy Animations of Tree Algorithms
In software visualization and algorithm animation it is important that advances in system technologies are accompanied by corresponding advances in animation presentations. In thi...
John T. Stasko, Carlton Reid Turner
SIGADA
2005
Springer
14 years 2 months ago
Experiences using SPARK in an undergraduate CS course
This paper describes experiences garnered while teaching a course on high integrity software using SPARK to a mix of junior and senior level undergraduates. The paper describes th...
Anthony S. Ruocco