Sciweavers

2652 search results - page 390 / 531
» Privacy-preserving linear programming
Sort
View
ICSE
2008
IEEE-ACM
15 years 11 months ago
Sufficient mutation operators for measuring test effectiveness
Mutants are automatically-generated, possibly faulty variants of programs. The mutation adequacy ratio of a test suite is the ratio of non-equivalent mutants it is able to identif...
Akbar Siami Namin, James H. Andrews, Duncan J. Mur...
SIGSOFT
2006
ACM
15 years 10 months ago
Lightweight extraction of syntactic specifications
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
Mana Taghdiri, Robert Seater, Daniel Jackson
SIGSOFT
2005
ACM
15 years 10 months ago
Fluent temporal logic for discrete-time event-based models
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...
Emmanuel Letier, Jeff Kramer, Jeff Magee, Sebasti&...
156
Voted
CP
2009
Springer
15 years 10 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang
RECOMB
2009
Springer
15 years 10 months ago
Lifting Prediction to Alignment of RNA Pseudoknots
Prediction and alignment of RNA pseudoknot structures are NP-hard. Nevertheless, several efficient prediction algorithms by dynamic programming have been proposed for restricted cl...
Mathias Möhl, Rolf Backofen, Sebastian Will