Sciweavers

1023 search results - page 82 / 205
» A Formal Method for Program Slicing
Sort
View
ACSC
2004
IEEE
14 years 16 days ago
Automatic Derivation of Loop Termination Conditions to Support Verification
This paper introduces a repeatable and constructive approach to the analysis of loop progress and termination conditions in imperative programs. It is applicable to all loops for ...
Daniel Powell
ICDCS
2002
IEEE
14 years 1 months ago
The Complexity of Adding Failsafe Fault-Tolerance
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
Sandeep S. Kulkarni, Ali Ebnenasir
ICFP
2012
ACM
11 years 11 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens
BMCBI
2011
13 years 11 days ago
A Novel And Well-Defined Benchmarking Method For Second Generation Read Mapping
Background: Second generation sequencing technologies yield DNA sequence data at ultra high-throughput. Common to most biological applications is a mapping of the reads to an almo...
Manuel Holtgrewe, Anne-Katrin Emde, David Weese, K...
APLAS
2010
ACM
13 years 9 months ago
JNI Light: An Operational Model for the Core JNI
Abstract. Through foreign function interfaces (FFIs), software components in different programming languages interact with each other in the same address space. Recent years have w...
Gang Tan