Sciweavers

3221 search results - page 228 / 645
» Termination of Linear Programs
Sort
View
APLAS
2004
ACM
15 years 12 months ago
Protocol Specialization
Abstract. In component-based programming, the programmer assembles applications from prefabricated components. The assembly process has two main steps: adapting a component by twea...
Matthias Neubauer, Peter Thiemann
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 6 months ago
Quasi-friendly sup-interpretations
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
Jean-Yves Marion, Romain Péchoux
TCS
2008
15 years 6 months ago
A timed semantics of Orc
Orc is a kernel language for structured concurrent programming. Orc provides three powerful combinators that define the structure of a concurrent computation. These combinators su...
Ian Wehrman, David Kitchin, William R. Cook, Jayad...
FOCS
2009
IEEE
16 years 1 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
KBSE
2007
IEEE
16 years 22 days ago
Assertion-based repair of complex data structures
Programmers have long used assertions to characterize properties of code. An assertion violation signals a corruption in the program state. At such a state, it is standard to term...
Bassem Elkarablieh, Ivan Garcia, Yuk Lai Suen, Sar...