Sciweavers

230 search results - page 15 / 46
» Constraint Orbital Branching
Sort
View
WCET
2008
13 years 9 months ago
Computing time as a program variable: a way around infeasible paths
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...
Niklas Holsti
SIAMAM
2008
76views more  SIAMAM 2008»
13 years 7 months ago
Stability of Solitary Waves in a Semiconductor Drift-Diffusion Model
We consider a macroscopic (drift-diffusion) model describing a simple microwave generator, consisting of a special type of semiconductor material that, when biased above a certain ...
C. M. Cuesta, C. Schmeiser
KBSE
1997
IEEE
13 years 11 months ago
Exploiting Domain-Specific Knowledge to Refine Simulation Specifications
This paper discusses our approach to the problem of refining high-level simulation specifications. Our domain is simulated combat training for tank platoon members. Our input is a...
David Pautler, Steven Woods, Alex Quilici
MP
2007
97views more  MP 2007»
13 years 7 months ago
On the domino-parity inequalities for the STSP
Abstract One method which has been used very successfully for finding optimal and provably good solutions for large instances of the Symmetric Travelling Salesman Problem (STSP) i...
Sylvia C. Boyd, Sally Cockburn, Danielle Vella
SIGMOD
2011
ACM
290views Database» more  SIGMOD 2011»
12 years 10 months ago
Database state generation via dynamic symbolic execution for coverage criteria
Automatically generating sufficient database states is imperative to reduce human efforts in testing database applications. Complementing the traditional block or branch coverage...
Kai Pan, Xintao Wu, Tao Xie