Sciweavers

3221 search results - page 192 / 645
» Termination of Linear Programs
Sort
View
CADE
2005
Springer
16 years 6 months ago
A Focusing Inverse Method Theorem Prover for First-Order Linear Logic
We present the theory and implementation of a theorem prover for first-order intuitionistic linear logic based on the inverse method. The central proof-theoretic insights underlyin...
Kaustuv Chaudhuri, Frank Pfenning
EUROGP
2001
Springer
15 years 11 months ago
Exact Schema Theorems for GP with One-Point and Standard Crossover Operating on Linear Structures and Their Application to the S
In this paper, firstly we specialise the exact GP schema theorem for one-point crossover to the case of linear structures of variable length, for example binary strings or program...
Riccardo Poli, Nicholas Freitag McPhee
ORL
2008
111views more  ORL 2008»
15 years 6 months ago
Certificates of linear mixed integer infeasibility
A central result in the theory of integer optimization states that a system of linear diophantine equations Ax = b has no integral solution if and only if there exists a vector in...
Kent Andersen, Quentin Louveaux, Robert Weismantel
CORR
2004
Springer
85views Education» more  CORR 2004»
15 years 6 months ago
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
Patricia M. Hill, Enea Zaffanella, Roberto Bagnara
FOSSACS
2011
Springer
14 years 10 months ago
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
Naoki Kobayashi