Results 1  10
of
1,122,750
Floatingpoint verification
 International Journal Of ManMachine Studies
, 1995
"... Abstract: This paper overviews the application of formal verification techniques to hardware in general, and to floatingpoint hardware in particular. A specific challenge is to connect the usual mathematical view of continuous arithmetic operations with the discrete world, in a credible and verifia ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Abstract: This paper overviews the application of formal verification techniques to hardware in general, and to floatingpoint hardware in particular. A specific challenge is to connect the usual mathematical view of continuous arithmetic operations with the discrete world, in a credible
Formal Verification of FloatingPoint Programs
, 2007
"... This paper introduces a methodology to perform formal verification of floatingpoint C programs. It extends an existing tool for the verification of C programs, Caduceus, with new annotations specific to floatingpoint arithmetic. The Caduceus firstorder logic model for C programs is extended acc ..."
Abstract

Cited by 29 (7 self)
 Add to MetaCart
This paper introduces a methodology to perform formal verification of floatingpoint C programs. It extends an existing tool for the verification of C programs, Caduceus, with new annotations specific to floatingpoint arithmetic. The Caduceus firstorder logic model for C programs is ex
ConstraintBased Automatic Test Data Generation
 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
, 1991
"... This paper presents a new technique for automatically generating test data. The technique is based on mutation analysis and creates test data that approximates relative adequacy. The technique is a faultbased technique that uses algebraic constraints to describe test cases designed to find particul ..."
Abstract

Cited by 314 (30 self)
 Add to MetaCart
This paper presents a new technique for automatically generating test data. The technique is based on mutation analysis and creates test data that approximates relative adequacy. The technique is a faultbased technique that uses algebraic constraints to describe test cases designed to find
Assigned Numbers
 STD 2, RFC 1700, USC/Information Sciences Institute
, 1994
"... Status of this Memo ..."
FloatingPoint Verification
"... This project aims to demonstrate that it is practical, using existing theorem proving technology, to formally verify industrially significant floating point algorithms and their implementations. Models of such algorithms will be mechanically verified with the hol theorem proving system against prec ..."
Abstract
 Add to MetaCart
precise specifications, often based on real numbers. Industry is sceptical about the value of formal verification. It is hoped that our studies will help convince manufacturers that the potential benefits far outweigh the costs. This could have a tremendous impact on the industrial uptake of `formal
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1384 (62 self)
 Add to MetaCart
system. We also show how this approach can be adapted to handle fairness. We argue that our technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finitestate concurrent systems. Experimental results show that state machines
Genetic Programming
, 1997
"... Introduction Genetic programming is a domainindependent problemsolving approach in which computer programs are evolved to solve, or approximately solve, problems. Genetic programming is based on the Darwinian principle of reproduction and survival of the fittest and analogs of naturally occurring ..."
Abstract

Cited by 1051 (12 self)
 Add to MetaCart
Introduction Genetic programming is a domainindependent problemsolving approach in which computer programs are evolved to solve, or approximately solve, problems. Genetic programming is based on the Darwinian principle of reproduction and survival of the fittest and analogs of naturally occurring
An Overview of the C++ Programming Language
, 1999
"... This overview of C++ presents the key design, programming, and languagetechnical concepts using examples to give the reader a feel for the language. C++ is a generalpurpose programming language with a bias towards systems programming that supports efficient lowlevel computation, data abstraction, ..."
Abstract

Cited by 1766 (15 self)
 Add to MetaCart
This overview of C++ presents the key design, programming, and languagetechnical concepts using examples to give the reader a feel for the language. C++ is a generalpurpose programming language with a bias towards systems programming that supports efficient lowlevel computation, data abstraction
A Survey of Program Slicing Techniques
 JOURNAL OF PROGRAMMING LANGUAGES
, 1995
"... A program slice consists of the parts of a program that (potentially) affect the values computed at some point of interest, referred to as a slicing criterion. The task of computing program slices is called program slicing. The original definition of a program slice was presented by Weiser in 197 ..."
Abstract

Cited by 777 (8 self)
 Add to MetaCart
A program slice consists of the parts of a program that (potentially) affect the values computed at some point of interest, referred to as a slicing criterion. The task of computing program slices is called program slicing. The original definition of a program slice was presented by Weiser
Results 1  10
of
1,122,750