Show simple item record

dc.contributor.authorGabay, Yaromen_US
dc.contributor.authorOcean, Michael J.en_US
dc.contributor.authorKfoury, Assaf J.en_US
dc.contributor.authorLiu, Likaien_US
dc.date.accessioned2011-10-20T05:23:42Z
dc.date.available2011-10-20T05:23:42Z
dc.date.issued2006-02-06en_US
dc.identifier.urihttps://hdl.handle.net/2144/1862
dc.description.abstractSensor applications in Sensoria [1] are expressed using STEP (Sensorium Task Execution Plan). SNAFU (Sensor-Net Applications as Functional Units) serves as a high-level sensor-programming language, which is compiled into STEP. In SNAFU’s current form, its differences with STEP are relatively minor, as they are limited to shorthands and macros not available in STEP. We show that, however restrictive it may seem, SNAFU has in fact universal power; technically, it is a Turing-complete language, i.e., any Turing program can be written in SNAFU (though not always conveniently). Although STEP may be allowed to have universal power, as a low-level language not directly available to Sensorium users, SNAFU programmers may use this power for malicious purposes or inadvertently introduce errors with destructive consequences. In future developments of SNAFU, we plan to introduce restrictions and highlevel features with safety guards, such as those provided by a type system, which will make SNAFU programming safer.en_US
dc.description.sponsorshipNational Science Foundation (EIA-0202067)en_US
dc.language.isoen_USen_US
dc.publisherBoston University Computer Science Departmenten_US
dc.relation.ispartofseriesBUCS Technical Reports;BUCS-TR-2006-001en_US
dc.titleComputational Properties of SNAFUen_US
dc.typeTechnical Reporten_US


This item appears in the following Collection(s)

Show simple item record