| dc.contributor.author | Lezuo, Roland | |
| dc.contributor.author | Barany, Gergö | |
| dc.contributor.author | Krall, Andreas | |
| dc.contributor.editor | Wagner, Stefan | |
| dc.contributor.editor | Lichter, Horst | |
| dc.date.accessioned | 2018-10-24T10:00:38Z | |
| dc.date.available | 2018-10-24T10:00:38Z | |
| dc.date.issued | 2013 | |
| dc.identifier.isbn | 978-3-88579-609-1 | |
| dc.identifier.issn | 1617-5468 | |
| dc.identifier.uri | http://dl.gi.de/handle/20.500.12116/17416 | |
| dc.description.abstract | In this paper we present CASM, a general purpose programming language based on abstract state machines (ASMs). We describe the implementation of an interpreter and a compiler for the language. The demand for efficient execution forced us to modify the definition of ASM and we discuss the impact of those changes. A novel feature for ASM based languages is symbolic execution, which we briefly describe. CASM is used for instruction set simulator generation and for semantic description in a compiler verification project. We report on the experience of using the language in those two projects. Finally we position ASM based programming languages as an elegant combination of imperative and functional programming paradigms which may liberate us from the von Neumann style as demanded by John Backus. | en |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | Software Engineering 2013 - Workshopband | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-215 | |
| dc.title | CASM: Implementing an Abstract State Machine based Programming Language | en |
| dc.type | Text/Conference Paper | |
| dc.pubPlace | Bonn | |
| mci.reference.pages | 75-90 | |
| mci.conference.sessiontitle | Regular Research Papers | |
| mci.conference.location | Aachen | |
| mci.conference.date | 26. Februar-1. März 2013 | |
