Abstracting an Operational Semantics to Finite Automata

There is an apparent similarity between the descriptions of small-step operational semantics of imperative programs and the semantics of finite automata, so defining an abstraction mapping from semantics to automata and proving a simulation property seems to be easy.This paper aims at identifying the reasons why simple proofs break,among them artifacts in the semantics that lead to stuttering steps in the simulation. We then present a semantics based on the zipper data structure, with a direct interpretation of evaluation as navigation in the syntax tree. The abstraction function is then defined by an equivalence class construction

Dissidents and God-Talk in the Johannine Epistles

Peer reviewe

Meta Modeling for Business Process Improvement

Conducting business process improvement (BPI) initiatives is a topic of high priority for today’s companies. However, performing BPI projects has become challenging. This is due to rapidly changing customer requirements and an increase of inter-organizational business processes, which need to be considered from an end-to-end perspective. In addition, traditional BPI approaches are more and more perceived as overly complex and too resource-consuming in practice. Against this background, the paper proposes a BPI roadmap, which is an approach for systematically performing BPI projects and serves practitioners’ needs for manageable BPI methods. Based on this BPI roadmap, a domain-specific conceptual modeling method (DSMM) has been developed. The DSMM supports the efficient documentation and communication of the results that emerge during the application of the roadmap. Thus, conceptual modeling acts as a means for purposefully codifying the outcomes of a BPI project. Furthermore, a corresponding software prototype has been implemented using a meta modeling platform to assess the technical feasibility of the approach. Finally, the usability of the prototype has been empirically evaluated