1204 search results - page 158 / 241 » Termination of Polynomial Programs |
98
Voted
ESOP
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we present an alternative approach to interprocedurally g linear inequality relations. We propose an abstraction of the effects of procedures through convex sets of t...
86
Voted
LCTRTS
2004
Springer
15 years 6 months ago
2004
Springer
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
103
Voted
CPM
2010
Springer
15 years 5 months ago
2010
Springer
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
91
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
87
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trac...