Sciweavers

3221 search results - page 134 / 645
» Termination of Linear Programs
Sort
View
AMAST
2008
Springer
15 years 5 months ago
Long-Run Cost Analysis by Approximation of Linear Operators over Dioids
Abstract. We present a static analysis technique for modeling and approximating the long-run resource usage of programs. The approach is based on a quantitative semantic framework ...
David Cachera, Thomas P. Jensen, Arnaud Jobin, Pas...
COCO
2007
Springer
107views Algorithms» more  COCO 2007»
15 years 9 months ago
A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover
We study semidefinite programming relaxations of Vertex Cover arising from repeated applications of the LS+ “lift-and-project” method of Lovasz and Schrijver starting from th...
Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani
ICALP
2009
Springer
16 years 3 months ago
An Explicit Formula for the Free Exponential Modality of Linear Logic
Christine Tasson, Nicolas Tabareau, Paul-Andr&eacu...
ICLP
2010
Springer
15 years 7 months ago
Focused Proof Search for Linear Logic in the Calculus of Structures
The proof-theoretic approach to logic programming has benefited from the
Nicolas Guenot
APLAS
2010
ACM
15 years 3 months ago
Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational Semantics
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
Jan Hoffmann 0002, Martin Hofmann