Generalizing Semantic Bidirectionalization & Tracking Generated Expressions

Visa enkel post
dc.contributor.authorNajd Javadipour, Shayan
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)sv
dc.contributor.departmentChalmers University of Technology / Department of Computer Science and Engineering (Chalmers)en
dc.date.accessioned2019-07-03T13:08:33Z
dc.date.available2019-07-03T13:08:33Z
dc.date.issued2013
dc.description.abstractIn programming, there are often pairs of functions running in opposite directions: the domain of one is the codomain of the other. Their functionalities are so closely related that it is possible to derive one from the implementation of the other. Bidirectionalization techniques address this concern. This thesis studies some of the theoretical and practical aspects of bidirectionalization. As the theoretical part of this thesis, we generalize an existing bidirectionalization technique, known as semantic bidirectionalization. Our generalized algorithm scales well and lifts some of the restrictions set by the original algorithm. As the practical part of this thesis, we focus on the problem of tracking expressions in the low-level generated code to their origins in the high-level code.
dc.identifier.urihttps://hdl.handle.net/20.500.12380/176426
dc.language.isoeng
dc.setspec.uppsokTechnology
dc.subjectData- och informationsvetenskap
dc.subjectComputer and Information Science
dc.titleGeneralizing Semantic Bidirectionalization & Tracking Generated Expressions
dc.type.degreeExamensarbete för masterexamensv
dc.type.degreeMaster Thesisen
dc.type.uppsokH
local.programmeComputer science – algorithms, languages and logic (MPALG), MSc
Ladda ner
Original bundle
Visar 1 - 1 av 1
Bild (thumbnail)
Namn:
176426.pdf
Storlek:
1.49 MB
Format:
Adobe Portable Document Format
Beskrivning:
Fulltext
Ladda ner
Samling
Examensarbeten för masterexamen