Sciweavers

3221 search results - page 254 / 645
» Termination of Linear Programs
Sort
View
ENTCS
2000
80views more  ENTCS 2000»
15 years 6 months ago
Behavioral and Coinductive Rewriting
Behavioral rewriting di ers from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including noti...
Joseph A. Goguen, Kai Lin, Grigore Rosu
CAV
2012
Springer
334views Hardware» more  CAV 2012»
13 years 9 months ago
Joogie: Infeasible Code Detection for Java
We present Joogie, a tool that detects infeasible code in Java programs. Infeasible code is code that does not occur on feasible controlflow paths and thus has no feasible executi...
Stephan Arlt, Martin Schäf
DAGSTUHL
1996
15 years 7 months ago
Global Control for Partial Deduction through Characteristic Atoms and Global Trees
Recently, considerable advances have been made in the (on-line) control of logic program specialisation. A clear conceptual distinction has been established between local and glob...
Michael Leuschel, Bern Martens
ESOP
2009
Springer
16 years 1 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell
IOR
2008
109views more  IOR 2008»
15 years 6 months ago
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...
Yongpei Guan, Andrew J. Miller