DeepAI AI Chat
Log In Sign Up

Linear Tree Constraints

by   Sabine Bauer, et al.

Linear tree constraints were introduced by Hofmann and Rodriguez in the context of amortized resource analysis for object oriented programs. More precisely, they gave a reduction from inference of resource types to constraint solving. Thus, once we have found an algorithm to solve the constraints generated from a program, we can read off the resource consumption from their solutions. These constraints have the form of pointwise linear inequalities between infinite trees labeled with nonnegative rational numbers. We are interested in the question if a system of such constraints is simultaneously satisfiable. Bauer and Hofmann have recently identified a fragment of the tree constraint problem (UTC) that is still sufficient for program analysis and they proved that the list case of UTC is decidable, whereas the case with trees of degree at least two remained open. In this paper, we solve this problem. We give a decision procedure that covers the entire range of constraints needed for resource analysis.


page 1

page 2

page 3

page 4


Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP

De Klerk, Pasechnik, and Sotirov give a semidefinite programming constra...

Revisiting Call-by-value Bohm trees in light of their Taylor expansion

The call-by-value lambda calculus can be endowed with permutation rules,...

Weisfeiler-Leman meets Homomorphisms

In this paper, we relate a beautiful theory by Lovász with a popular heu...

Supercompiling String Programs Using Word Equations as Constraints

We describe a general parameterized scheme of program and constraint ana...

Contractibility for Open Global Constraints

Open forms of global constraints allow the addition of new variables to ...

Probabilistic Deduction with Conditional Constraints over Basic Events

We study the problem of probabilistic deduction with conditional constra...

Speeding Up Distributed Pseudo-tree Optimization Procedure with Cross Edge Consistency to Solve DCOPs

Distributed Pseudo-tree Optimization Procedure (DPOP) is a well-known me...