We present an automated method for the static prediction of the run-time error 'deadlock or failure' in concurrent constraint programs. The method is based on a new set-based analysis of reactive logic programs which computes an approximation of the greatest-model semantics. Semantically, the method is based on the connection between the inevitability of 'deadlock or failure' in concurrent constraint programs, finite failure in logic programming and the greatest-model semantics over infinite trees.
Download PDF Show BibTeX
Login to edit