Sciweavers

55 search results - page 2 / 11
» Abduction of Linear Arithmetic Constraints
Sort
View
SODA
1998
ACM
114views Algorithms» more  SODA 1998»
13 years 6 months ago
Exact Arithmetic at Low Cost - A Case Study in Linear Programming
We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...
Bernd Gärtner
UIST
1997
ACM
13 years 9 months ago
Solving Linear Arithmetic Constraints for User Interface Applications
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring th...
Alan Borning, Kim Marriott, Peter J. Stuckey, Yi X...
FSTTCS
2006
Springer
13 years 9 months ago
Validity Checking for Finite Automata over Linear Arithmetic Constraints
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
Gary Wassermann, Zhendong Su
CAV
2007
Springer
93views Hardware» more  CAV 2007»
13 years 11 months ago
LIRA: Handling Constraints of Linear Arithmetics over the Integers and the Reals
Bernd Becker, Christian Dax, Jochen Eisinger, Feli...
CORR
2008
Springer
130views Education» more  CORR 2008»
13 years 5 months ago
Convex Hull of Arithmetic Automata
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
Jérôme Leroux