FPgen - a test generation framework for datapath floating-point verification

Aharoni, M.; Asaf, Sigal; Fournier, Laurent Sébastien; Koifman, A.; Nagel, R.

doi:10.1109/hldvt.2003.1252469

Cited by 30 publications

(20 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The benchmarks from each team provide a relatively unbiased target for evaluating the other team's tool. The benchmark creation process has also led to a supporting contribution: (4) an open-source set of floating-point benchmarks tailored for symbolic execution tools [28]- [30].…”

Section: Summary Of Lessons Learned and Supporting Contributionsmentioning

confidence: 99%

“…[4], [8], [22], [23], [39]), and various methods have been proposed for verifying floating-point properties through abstract interpretation [35], [36], [65], decision procedures [16], [40], [50], [81], [82], theorem proving [9], [10], and combinations of techniques [13], [14], [62], [63]. Recent work has also focused on estimating bounds on round-off error in floating-point computation [26], [55], [73].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Floating-point symbolic execution: A case study in N-version programming

Liew

Schemmel

Cadar

et al. 2017

2017 32nd IEEE/ACM International Conference on Automated Software Engineering (ASE)

View full text Add to dashboard Cite

Abstract-Symbolic execution is a well-known program analysis technique for testing software, which makes intensive use of constraint solvers. Recent support for floating-point constraint solving has made it feasible to support floating-point reasoning in symbolic execution tools. In this paper, we present the experience of two research teams that independently added floating-point support to KLEE, a popular symbolic execution engine. Since the two teams independently developed their extensions, this created the rare opportunity to conduct a rigorous comparison between the two implementations, essentially a modern case study on Nversion programming. As part of our comparison, we report on the different design and implementation decisions taken by each team, and show their impact on a rigorously assembled and tested set of benchmarks, itself a contribution of the paper.

show abstract

Section: Summary Of Lessons Learned and Supporting Contributionsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Floating-point symbolic execution: A case study in N-version programming

Liew

Schemmel

Cadar

et al. 2017

2017 32nd IEEE/ACM International Conference on Automated Software Engineering (ASE)

View full text Add to dashboard Cite

show abstract

“…In addition, the generation core can be extended with custom generators (which are useful when situations are hardly expressible in terms of constraints). There is also a library of predefined generators including random generators and directed generators (e.g., for the floating-point arithmetic [16]). …”

Section: Extendable Framework Conceptmentioning

confidence: 99%

MicroTESK: An Extendable Framework for Test Program Generation

Kamkin¹,

Sergeeva²,

Tatarnikov³

et al. 2013

Proceedings of the Spring/Summer Young Researchers' Colloquium on Software Engineering

View full text Add to dashboard Cite

Abstract-Creation of test programs and analysis of their execution is the main approach to system-level verification of microprocessors. A lot of techniques have been proposed to automate test program generation, ranging from completely random to well directed ones. However, no "silver bullet" has been found. In good industrial practices, various methods are combined complementing each other. Unfortunately, there is no solution that could integrate all (or at least most) of the techniques in a single framework. Engineers are forced to use a number of tools, which leads to the following problems: (1) it is required to maintain duplicating data (each tool uses its own representation of the target design); (2) to be used together, tools need to be integrated (engineers have to deal with different formats and interfaces). This paper proposes a concept of an extendable framework (MicroTESK) that follows a unified methodology for defining test program generation techniques. The framework supports random and combinatorial generation and (what is even more important) can be easily extended with new techniques being implemented as the framework's plugins.

show abstract

“…Phi-node folding usually operates on the static singleassignment (SSA) form of a program [Alpern 1988] and targets branches with a control flow structure matching the diamond pattern shown in Figure 3, commonly associated with if statements and the C ternary operator. The beginning of block D contains one or more phi nodes, which select the correct register values (in our example, that of %r) depending on what block was previously executed.…”

Section: Phi Node Foldingmentioning

confidence: 99%

“…An alternative to formal verification is testing. For example, Aharoni [2003] uses randomized testing coupled with coverage requirements to test floating point programs. Random testing can easily be applied to large applications, but misses corner-case bugs that are common in floating point programs.…”

Section: Klee-fp As a Development Toolmentioning

confidence: 99%

Symbolic crosschecking of floating-point and SIMD code

Collingbourne

Cadar

Kelly

2011

Proceedings of the Sixth Conference on Computer Systems

View full text Add to dashboard Cite

We present an effective technique for crosschecking an IEEE 754 floating-point program and its SIMD-vectorized version, implemented in KLEE-FP, an extension to the KLEE symbolic execution tool that supports symbolic reasoning on the equivalence between floating-point values.The key insight behind our approach is that floatingpoint values are only reliably equal if they are essentially built by the same operations. As a result, our technique works by lowering the Intel Streaming SIMD Extension (SSE) instruction set to primitive integer and floating-point operations, and then using an algorithm based on symbolic expression matching augmented with canonicalization rules.Under symbolic execution, we have to verify equivalence along every feasible control-flow path. We reduce the branching factor of this process by aggressively merging conditionals, if-converting branches into select operations via an aggressive phi-node folding transformation.We applied KLEE-FP to OpenCV, a popular open source computer vision library. KLEE-FP was able to successfully crosscheck 51 SIMD/SSE implementations against their corresponding scalar versions, proving the bounded equivalence of 41 of them (i.e., on images up to a certain size), and finding inconsistencies in the other 10.

show abstract

FPgen - a test generation framework for datapath floating-point verification

Cited by 30 publications

References 16 publications

Floating-point symbolic execution: A case study in N-version programming

Floating-point symbolic execution: A case study in N-version programming

MicroTESK: An Extendable Framework for Test Program Generation

Symbolic crosschecking of floating-point and SIMD code

Contact Info

Product

Resources

About