Normalizable horn clauses, strongly recognizable relations, and spi

Flemming Nielson, Hanne Riis Nielson, Helmut Seidl

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

20 Scopus citations

Abstract

We exhibit a rich class of Horn clauses, which we call H1, whose least models, though possibly infinite, can be computed effectively. We show that the least model of an H1 clause consists of so-called strongly recognizable relations and present an exponential normalization procedure to compute it. In order to obtain a practical tool for program analysis, we identify a restriction of H1 clauses, which we call H2, where the least models can be computed in polynomial time. This fragment still allows to express, e.g., Cartesian product and transitive closure of relations. Inside H2, we exhibit a fragment H3 where normalization is even cubic. We demonstrate the usefulness of our approach by deriving a cubic control-flow analysis for the Spi calculus [1] as presented in [14].

Original languageEnglish
Title of host publicationStatic Analysis - 9th International Symposium, SAS 2002 Madrid, Spain, September 17-20, 2002 Proceedings
EditorsManuel V. Hermenegildo, German Puebla
PublisherSpringer Verlag
Pages35-2002
Number of pages1968
ISBN (Print)3540442359
DOIs
StatePublished - 2002
Externally publishedYes
Event9th International Static Analysis Symposium, SAS 2002 - Madrid, Spain
Duration: 17 Sep 200220 Sep 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2477
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Static Analysis Symposium, SAS 2002
Country/TerritorySpain
CityMadrid
Period17/09/0220/09/02

Keywords

  • Program analysis
  • Spi calculus
  • Strongly recognizable relations
  • Uniform horn clauses

Fingerprint

Dive into the research topics of 'Normalizable horn clauses, strongly recognizable relations, and spi'. Together they form a unique fingerprint.

Cite this