Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
413
TO CODE OR NOT TO CODE
, 2002
"... de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury: ..."
Abstract
- Add to MetaCart
de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury:
Interrupt Verification via Thread Verification
, 2007
"... Most of the research effort towards verification of concurrent software has focused on multithreaded code. On the other hand, concurrency in low-end embedded systems is predominantly based on interrupts. Low-end embedded systems are ubiquitous in safety-critical applications such as those supporting ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
Most of the research effort towards verification of concurrent software has focused on multithreaded code. On the other hand, concurrency in low-end embedded systems is predominantly based on interrupts. Low-end embedded systems are ubiquitous in safety-critical applications such as those
SIMULATION BOUNDS FOR EQUIVALENCE VERIFICATION OF ARITHMETIC DATAPATHS WITH FINITE WORD-LENGTH OPERANDS
"... This paper addresses simulation-based verification of highlevel descriptions of arithmetic datapaths. Instances of such designs are commonly found in DSP for audio, video and multimedia applications, where the word-lengths of input/output bit-vectors are fixed according to the desired precision. In ..."
Abstract
- Add to MetaCart
. Initial descriptions of such systems are usually specified as Matlab/C code. These are then automatically translated into behavioural/RTL descriptions (HDL) for subsequent hardware synthesis. In order to verify that the initial Matlab/C model is bit-true equivalent to the translated RTL, how many
Formal verification of practical mpi programs
- In PPoPP ’09: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
, 2009
"... This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our approach, we directly model-check the MPI/C source code, executing its interleavings with the help of a verification schedul ..."
Abstract
-
Cited by 29 (9 self)
- Add to MetaCart
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our approach, we directly model-check the MPI/C source code, executing its interleavings with the help of a verification
Model checking continuous-time Markov chains by transient analysis
, 2000
"... . The verification of continuous-time Markov chains (CTMCs) against continuous stochastic logic (CSL) [3, 6], a stochastic branchingtime temporal logic, is considered. CSL facilitates among others the specification of steady-state properties and the specification of probabilistic timing properties o ..."
Abstract
-
Cited by 91 (21 self)
- Add to MetaCart
of the form P# #p(#1 U I #2 ), for state formulas #1 and #2 , comparison operator ##, probability p, and real interval I. The main result of this paper is that model checking probabilistic timing properties can be reduced to the problem of computing transient state probabilities for CTMCs. This allows
Automated verification of practical garbage collectors
- In POPL
, 2009
"... Garbage collectors are notoriously hard to verify, due to their low-level interaction with the underlying system and the general dif-ficulty in reasoning about reachability in graphs. Several papers have presented verified collectors, but either the proofs were hand-written or the collectors were to ..."
Abstract
-
Cited by 16 (1 self)
- Add to MetaCart
too simplistic to use on practical applications. In this work, we present two mechanically verified garbage collectors, both practical enough to use for real-world C# benchmarks. The collectors and their associated allocators consist of x86 assembly language instructions and macro instructions, an
Automatic Formal Verification of DSP Software
- IN 37TH ACM/IEEE DESIGN AUTOMATION CONFERENCE
, 2000
"... This paper describes a novel formal verification approach for equivalence checking of small, assembly-language routines for digital signal processors (DSP). By combining control-flow analysis, symbolic simulation, automatic decision procedures, and some domainspecific optimizations, we have built an ..."
Abstract
-
Cited by 14 (0 self)
- Add to MetaCart
an automatic verification tool that compares structurally similar DSP assembly language routines. We tested our tool on code samples taken from a real application program and discovered several previously unknown bugs automatically. Runtime and memory requirements were reasonable on all examples. Our approach
Verification and Validation of AI Systems . . .
, 1997
"... interpretation is often applied through fixed mappings for various types of analysis used in compiler optimization, such as dead code detection. In this ongoing research, we are applying abstract interpretation through dynamically determined mappings to reduce the state space for model-checking. To ..."
Abstract
- Add to MetaCart
. Walking backwards through the code from this operation, this one equivalence class is then recursively partitioned into distinct classes according to those states satisfying the weakest precondition for each statement. At worst, the original state space is regenerated. 8 Summary Verification technology
General Terms Verification, Experimentation
"... We present a study of all sources of aliasing in over one million lines of C code, identifying in the process the common patterns of aliasing that arise in practice. We find that aliasing has a great deal of structure in real programs and that just nine programming idioms account for nearly all alia ..."
Abstract
- Add to MetaCart
We present a study of all sources of aliasing in over one million lines of C code, identifying in the process the common patterns of aliasing that arise in practice. We find that aliasing has a great deal of structure in real programs and that just nine programming idioms account for nearly all
On Equivalence Partitioning of Code Paths inside OS Kernel Components ∗
"... Commercial-off-the-shelf operating systems (COTS OSs) are increasingly chosen as key building blocks in embedded system design due to their rich feature-set available at low costs. Unfortunately, as the complexity of such OSs increases, testing key OS components such as device drivers (DD) to ensure ..."
Abstract
- Add to MetaCart
while assuming no access to source code, our work enables profiling the runtime behavior of DDs solely based on I/Oand functional-call tracking. Such profiles are used to improve test adequacy against real-world workloads by enabling similarity quantification across them. The profiles also reveal
Results 1 - 10
of
413
