Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP

  • Authors:
  • Witold Charatonik;Supratik Mukhopadhyay;Andreas Podelski

  • Affiliations:
  • -;-;-

  • Venue:
  • ICLP '02 Proceedings of the 18th International Conference on Logic Programming
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Forward analysis procedures for infinite-state systems such as timed systems were limited to safety properties. We give the first constraint-based forward analysis for infinite-state systems that goes beyond safety properties. Namely, we take the restriction of the 碌-calculus to least-fixpoint formulas where negation is applied to closed subformulas only. We characterize these properties as perfect models of constraint logic programs, and we present a tabulation procedure for the top-down evaluation of stratified constraint logic programs.