Sciweavers

114 search results - page 19 / 23
» Dynamic Dependency Analysis of Ordinary Programs
Sort
View
107
Voted
BMCBI
2007
167views more  BMCBI 2007»
14 years 10 months ago
A stochastic differential equation model for transcriptional regulatory networks
Background: This work explores the quantitative characteristics of the local transcriptional regulatory network based on the availability of time dependent gene expression data se...
Adriana Climescu-Haulica, Michelle D. Quirk
ICSE
2010
IEEE-ACM
15 years 3 months ago
From behaviour preservation to behaviour modification: constraint-based mutant generation
The efficacy of mutation analysis depends heavily on its capability to mutate programs in such a way that they remain executable and exhibit deviating behaviour. Whereas the forme...
Friedrich Steimann, Andreas Thies
CCR
2004
151views more  CCR 2004»
14 years 10 months ago
Practical verification techniques for wide-area routing
Protocol and system designers use verification techniques to analyze a system's correctness properties. Network operators need verification techniques to ensure the "cor...
Nick Feamster
99
Voted
CODES
2005
IEEE
15 years 3 months ago
SOMA: a tool for synthesizing and optimizing memory accesses in ASICs
Arbitrary memory dependencies and variable latency memory systems are major obstacles to the synthesis of large-scale ASIC systems in high-level synthesis. This paper presents SOM...
Girish Venkataramani, Tiberiu Chelcea, Seth Copen ...
ICPP
1999
IEEE
15 years 2 months ago
Trace-Level Reuse
Trace-level reuse is based on the observation that some traces (dynamic sequences of instructions) are frequently repeated during the execution of a program, and in many cases, th...
Antonio González, Jordi Tubella, Carlos Mol...