<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>32</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Nuno Macedo</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Alcino Cunha</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Translating Alloy specifications to the point-free style</style></title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Alloy</style></keyword><keyword><style  face="normal" font="default" size="100%">Point-free</style></keyword><keyword><style  face="normal" font="default" size="100%">Relational calculus</style></keyword><keyword><style  face="normal" font="default" size="100%">Translation</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">September</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/nmacedo/files/nunomacedomsc.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">University of Minho</style></publisher><pub-location><style face="normal" font="default" size="100%">Braga, Portugal</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Every program starts from a model, an abstraction, which is iteratively re ned until we reach the&lt;br /&gt;
 nal result, the implementation. However, at the end, one must ask: does the nal program resemble&lt;br /&gt;
 in anyway the original model? Was the original idea correct to begin with? Formal methods&lt;br /&gt;
 guarantee that those questions are answered positively, resorting to mathematical techniques. In&lt;br /&gt;
 particular, in this thesis we are interested on the second factor: veri cation of formal models.&lt;br /&gt;
 A trend of formal methods defends that they should be lightweight, resulting in a reduced&lt;br /&gt;
 complexity of the speci cation, and automated analysis. Alloy was proposed as a solution for this&lt;br /&gt;
 problem. In Alloy, the structures are described using a simple mathematical notation: relational&lt;br /&gt;
 logic. A tool for model checking, automatic veri cation within a given scope, is also provided.&lt;br /&gt;
 However, sometimes model checking is not enough and the need arises to perform unbounded&lt;br /&gt;
 veri cations. The only way to do this is to mathematically prove that the speci cations are correct.&lt;br /&gt;
 As such, there is the need to nd a mathematical logic expressive enough to be able to represent&lt;br /&gt;
 the speci cations, while still being su ciently understandable.&lt;br /&gt;
 We see the point-free style, a style where there are no variables or quanti cations, as a kind&lt;br /&gt;
 of Laplace transform, where complex problems are made simple. Being Alloy completely relational,&lt;br /&gt;
 we believe that a point-free relational logic is the natural framework to reason about Alloy&lt;br /&gt;
 speci cations.&lt;br /&gt;
 Our goal is to present a translation from Alloy speci cations to a point-free relational calculus,&lt;br /&gt;
 which can then be mathematically proven, either resorting to proof assistants or to manual proving.&lt;br /&gt;
 Since our motivation for the use of point-free is simplicity, we will focus on obtaining expressions&lt;br /&gt;
 that are simple enough for manipulation and proofs about them.&lt;/p&gt;
</style></abstract><work-type><style face="normal" font="default" size="100%">Master's Thesis</style></work-type></record></records></xml>