Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ENTCS
2008

favoriteEmaildiscussreport

108views more ENTCS 2008»

E-matching for Fun and Profit

13 years 4 months ago

E-matching for Fun and Profit

Download research.microsoft.com

Efficient handling of quantifiers is crucial for solving software verification problems. E-matching algorithms are used in satisfiability modulo theories solvers that handle quantified formulas through instantiation. Two novel, efficient algorithms for solving the E-matching problem are presented and compared to a well-known algorithm described in the literature.

Michal Moskal, Jakub Lopuszanski, Joseph R. Kiniry

Real-time Traffic

Algorithm | ENTCS 2008 | Satisfiability Modulo Theories | Software Verification Problems |

claim paper

Related Content

» Analyzing consistency properties for fun and profit

» Shilling recommender systems for fun and profit

» Distributed evolutionary computation for fun and profit

» Fixing Races for Fun and Profit How to Use access2

» Juggler Virtual Networks for Fun and Profit

» Exploiting smartphone USB connectivity for fun and profit

» DKSM Subverting Virtual Machine Introspection for Fun and Profit

» Simulating CyberAttacks for Fun and Profit

» Detecting spam web pages through content analysis

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	ENTCS
Authors	Michal Moskal, Jakub Lopuszanski, Joseph R. Kiniry

Comments (0)