A Quantifier Elimination Algorithm for Linear Real Arithmetic

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

accepted at LPAR '08

Scientific paper

We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutine satisfiability modulo this theory, a problem for which there are several implementations available. The quantifier elimination algorithm presented in the paper is compared, on examples arising from program analysis problems, to several other implementations, all of which cannot solve some of the examples that our algorithm solves easily.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Quantifier Elimination Algorithm for Linear Real Arithmetic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Quantifier Elimination Algorithm for Linear Real Arithmetic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Quantifier Elimination Algorithm for Linear Real Arithmetic will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-285852

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.