Sciweavers

1291 search results - page 70 / 259
» Arithmetic program paths
Sort
View
PTS
2010
175views Hardware» more  PTS 2010»
13 years 7 months ago
Test Data Generation for Programs with Quantified First-Order Logic Specifications
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
Christoph Gladisch
ECOOP
1995
Springer
14 years 1 months ago
Do Object-Oriented Languages Need Special Hardware Support?
Previous studies have shown that object-oriented programs have different execution characteristics than procedural programs, and that special object-oriented hardware can improve p...
Urs Hölzle, David Ungar
HICSS
2008
IEEE
122views Biometrics» more  HICSS 2008»
14 years 4 months ago
Pedagogy and Overview of a Graduate Program in Digital Investigation Management
Although still a relatively new undergraduate course of study at most colleges and universities, specialized degree programs in computer forensics and digital investigations are n...
Gary C. Kessler, Don Haggerty
EMSOFT
2003
Springer
14 years 3 months ago
Intelligent Editor for Writing Worst-Case-Execution-Time-Oriented Programs
Abstract. To guarantee timeliness in hard real-time systems the knowledge of the worst-case execution time (WCET) for its time-critical tasks is mandatory. Accurate and correct WCE...
Janosch Fauster, Raimund Kirner, Peter P. Puschner
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 4 months ago
Lower bound for deterministic semantic-incremental branching programs solving GEN
We answer a problem posed in [GKM08] regarding a restricted model of small-space computation, tailored for solving the GEN problem. They define two variants of “incremental bra...
Dustin Wehr