## Relational analysis of algebraic datatypes (2005)

### Cached

### Download Links

- [lara.epfl.ch]
- [www.lcs.mit.edu]
- [publications.csail.mit.edu]
- [www.mit.edu]
- [www.mit.edu]
- [sdg.csail.mit.edu]
- [publications.csail.mit.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | In Joint 10th European Software Engineering Conference (ESEC) and 13th ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE |

Citations: | 20 - 2 self |

### BibTeX

@INPROCEEDINGS{Kuncak05relationalanalysis,

author = {Viktor Kuncak and Daniel Jackson},

title = {Relational analysis of algebraic datatypes},

booktitle = {In Joint 10th European Software Engineering Conference (ESEC) and 13th ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE},

year = {2005},

pages = {55}

}

### Years of Citing Articles

### OpenURL

### 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. 1