Linear constraints over infinite trees

Authors:
Martin Hofmann;Dulma Rodriguez
Affiliations:
Department of Computer Science, University of Munich, München, Germany;Department of Computer Science, University of Munich, München, Germany
Venue:
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2012

Citing 4
Cited 1

Automatic Structures

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A coinductive calculus of binary trees

Information and Computation
Efficient type-checking for amortised heap-space analysis

CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Type-Based amortised heap-space analysis

ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems

Automatic type inference for amortised heap-space analysis

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider linear arithmetic constraints over infinite trees whose nodes are labelled with nonnegative real numbers. These constraints arose in the context of resource inference for object-oriented programs but should be of independent interest. It is as yet open whether satisfiability of these constraint systems is at all decidable. For a restricted fragment motivated from the application to resource inference we are however able to provide a heuristic decision procedure based on regular trees. We also observe that the related problem of optimising linear objectives over these infinite trees falls into the area of convex optimisation.