A quantitative analysis of OS noise
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
Set constraints are relations between sets of terms. They have been used extensively in various applications in program analysis and type inference. Recently, several algorithms for solving general systems of positive set constraints have appeared. In this paper we consider systems of mixed positive and negative constraints, which are considerably more expressive than positive constraints alone. We show that it is decidable whether a given such system has a solution. The proof involves a reduction to a number-theoretic decision problem that may be of independent interest. © 1995 Academic Press, Inc.
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
Michael D. Moffitt
ICCAD 2009
Gal Badishi, Idit Keidar, et al.
IEEE TDSC
Fan Zhang, Junwei Cao, et al.
IEEE TETC