Advanced Search
DSpace@MIT

From Formal Methods to Executable Code

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.advisor Nancy Lynch
dc.contributor.author Musial, Peter M. en_US
dc.contributor.other Theory of Computation en
dc.date.accessioned 2012-09-05T22:00:14Z
dc.date.available 2012-09-05T22:00:14Z
dc.date.issued 2012-08-27
dc.identifier.uri http://hdl.handle.net/1721.1/72537
dc.description Note: the cover page of this report shows an incorrect title. The title given on the first page of the document itself is correct. en_US
dc.description.abstract The objective of this work is the derivation of software that is verifiably correct. Our approach is to abstract system specifications and model these in a formal framework called Timed Input/Output Automata, which provides a notation for expressing distributed systems and mathematical support for reasoning about their properties. Although formal reasoning is easier at an abstract level, it is not clear how to transform these abstractions into executable code. During system implementation, when an abstract system specification is left up to human interpretation, then this opens a possibility of undesirable behaviors being introduced into the final code, thereby nullifying all formal efforts. This manuscript addresses this issue and presents a set of transformation methods for systems described as a network to timed automata into Java code for distributed platforms. We prove that the presented transformation methods preserve guarantees of the source specifications, and therefore, result in code that is correct by construction. en_US
dc.format.extent 92 p. en_US
dc.relation.ispartofseries MIT-CSAIL-TR-2012-027
dc.title From Formal Methods to Executable Code en_US


Files in this item

Name Size Format Description
MIT-CSAIL-TR-2012 ... 136.7Kb PDF

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage