Sciweavers

169 search results - page 8 / 34
» Abstract Interpretation of Algebraic Polynomial Systems (Ext...
Sort
View
KDD
2002
ACM
193views Data Mining» more  KDD 2002»
14 years 7 months ago
Query, analysis, and visualization of hierarchically structured data using Polaris
In the last several years, large OLAP databases have become common in a variety of applications such as corporate data warehouses and scientific computing. To support interactive ...
Chris Stolte, Diane Tang, Pat Hanrahan
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 2 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
SARA
2009
Springer
14 years 2 months ago
Tightened Transitive Closure of Integer Addition Constraints
We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ±x ± y ≤ d and bound co...
Peter Z. Revesz
ENTCS
2002
125views more  ENTCS 2002»
13 years 7 months ago
Specification of Logic Programming Languages from Reusable Semantic Building Blocks
We present a Language Prototyping System that facilitates the modular development of interpreters from independent semantic buildks. The abstract syntax is modelled as the fixpoint...
José Emilio Labra Gayo, Juan Manuel Cueva L...
LPAR
2007
Springer
14 years 1 months ago
Extending a Resolution Prover for Inequalities on Elementary Functions
Abstract. Experiments show that many inequalities involving exponentials and logarithms can be proved automatically by combining a resolution theorem prover with a decision procedu...
Behzad Akbarpour, Lawrence C. Paulson