Sciweavers

1204 search results - page 86 / 241
» Termination of Polynomial Programs
Sort
View
ESOP
2008
Springer
15 years 2 months ago
Inferring Channel Buffer Bounds Via Linear Programming
We present a static analysis for inferring the maximum amount of buffer space used by a program consisting of concurrently running processes communicating via buffered channels. We...
Tachio Terauchi, Adam Megacz
92
Voted
EUROGP
2001
Springer
105views Optimization» more  EUROGP 2001»
15 years 5 months ago
Adaptive Genetic Programming Applied to New and Existing Simple Regression Problems
Abstract. In this paper we continue our study on adaptive genetic programming. We use Stepwise Adaptation of Weights (saw) to boost performance of a genetic programming algorithm o...
Jeroen Eggermont, Jano I. van Hemert
ADAEUROPE
2007
Springer
15 years 6 months ago
Static Detection of Livelocks in Ada Multitasking Programs
Abstract. In this paper we present algorithms to statically detect livelocks in Ada multitasking programs. Although the algorithms’ worst-case execution time is exponential, they...
Johann Blieberger, Bernd Burgstaller, Robert Mitte...
94
Voted
INFORMS
2010
100views more  INFORMS 2010»
14 years 10 months ago
Two-Step MIR Inequalities for Mixed Integer Programs
Two-step MIR inequalities are valid inequalities derived from a facet of a simple mixedinteger set with three variables and one constraint. In this paper we investigate how to eff...
Sanjeeb Dash, Marcos Goycoolea, Oktay Günl&uu...
146
Voted
LICS
1995
IEEE
15 years 4 months ago
Structural Cut Elimination
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
Frank Pfenning