Show simple item record

On Relational Analysis of Algebraic Datatypes

dc.date.accessioned2005-12-22T02:25:50Z
dc.date.accessioned2018-11-24T10:24:27Z
dc.date.available2005-12-22T02:25:50Z
dc.date.available2018-11-24T10:24:27Z
dc.date.issued2005-04-05
dc.identifier.urihttp://hdl.handle.net/1721.1/30534
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/30534
dc.description.abstractWe present a technique that enables the use of finite modelfinding to check the satisfiability of certain formulaswhose intended models are infinite. Such formulas arisewhen using the language of sets and relations to reasonabout structured values such as algebraic datatypes. Thekey idea of our technique is to identify a natural syntacticclass of formulas in relational logic for which reasoningabout infinite structures can be reduced to reasoning aboutfinite structures. As a result, when a formula belongs tothis class, we can use existing finite model findingtools to check whether the formula holds in the desiredinfinite model.
dc.format.extent13 p.
dc.format.extent21208035 bytes
dc.format.extent893051 bytes
dc.language.isoen_US
dc.titleOn Relational Analysis of Algebraic Datatypes


Files in this item

FilesSizeFormatView
MIT-CSAIL-TR-2005-022.pdf893.0Kbapplication/pdfView/Open
MIT-CSAIL-TR-2005-022.ps21.20Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record