list | abstracts | bib ]

On Relational Analysis of Algebraic Datatypes

paper pdf    paper ps   

Abstract

We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when using the language of sets and relations to reason about structured values such as algebraic datatypes. The key idea of our technique is to identify a natural syntactic class of formulas in relational logic for which reasoning about infinite structures can be reduced to reasoning about finite structures. As a result, when a formula belongs to this class, we can use existing finite model finding tools to check whether the formula holds in the desired infinite model.

Citation

Viktor Kuncak and Daniel Jackson. On relational analysis of algebraic datatypes. Technical Report 985, MIT, April 2005. Full version of [46].

BibTex Entry

@TECHREPORT{KuncakJackson05OnRelationalAnalysisAlgebraicDatatypes,
  author = {Viktor Kuncak and Daniel Jackson},
  title = {On Relational Analysis of Algebraic Datatypes},
  institution = {MIT},
  year = 2005,
  number = 985,
  month = {April},
  note = {Full version of 
          \cite{KuncakJackson05RelationalAnalysisAlgebraicDatatypes}},
  localurl = {http://lara.epfl.ch/~kuncak/papers/KuncakJackson05OnRelationalAnalysisAlgebraicDatatypes.pdf}
}

list | abstracts | bib ]