@article{vonSteinauSteinrueckSura2023,
  author    = {von Steinau-Steinr{\"u}ck, Robert and Sura, Stephan},
  title     = {Die (Rest-)Zul{\"a}ssigkeit von Verboten religi{\"o}ser Zeichen am Arbeitsplatz},
  series = {NJW spezial},
  volume    = {20},
  journal   = {NJW spezial},
  number    = {8},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {242 -- 243},
  year      = {2023},
  abstract  = {In einer Reihe von Urteilen hat der EuGH seit 2017 die Zul{\"a}ssigkeit von Verboten religi{\"o}ser Zeichen und Kleidung am Arbeitsplatz bewertet. Obwohl die Einordnungen des Gerichtshofs der deutschen Rechtslage zun{\"a}chst diametral entgegenstanden, hat sich diese letztlich nicht ver{\"a}ndert.},
  language  = {de}
}
@article{vonSteinauSteinrueckMiller2022,
  author    = {von Steinau-Steinr{\"u}ck, Robert and Miller, Denis},
  title     = {R{\"u}ckzahlungsklauseln f{\"u}r Fortbildungen},
  series = {Neue juristische Wochenschrift : NJW Spezial},
  volume    = {19},
  journal   = {Neue juristische Wochenschrift : NJW Spezial},
  number    = {12},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {370 -- 371},
  year      = {2022},
  abstract  = {Mit Urteil vom 1.3.2022 (NZA2022, NZA Jahr 2022 Seite 780) hat das BAG erneut {\"u}ber die Wirksamkeit einer R{\"u}ckzahlungsklausel in einer Fortbildungsvereinbarung entschieden. Die Entscheidung reiht sich in eine nicht leicht zu durchschauende Anzahl von Urteilen hierzu ein. Sie dient uns zum Anlass, einen {\"U}berblick {\"u}ber die Rechtsprechung zu geben.},
  language  = {de}
}
@article{vonSteinauSteinrueckJoeris2021,
  author    = {von Steinau-Steinr{\"u}ck, Robert and J{\"o}ris, Nils},
  title     = {Brexit-Arbeitsrecht und die Folgen},
  series = {NJW spezial},
  volume    = {18},
  journal   = {NJW spezial},
  number    = {8},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {242 -- 243},
  year      = {2021},
  abstract  = {Die Corona-Pandemie hat den Brexit ein wenig in den Hintergrund gedr{\"a}ngt. Dabei hat er gerade im Arbeitsrecht ganz erhebliche Auswirkungen. {\"U}ber sie geben wir einen {\"U}berblick.},
  language  = {de}
}
@article{vonSteinauSteinrueckHoeltge2022,
  author    = {von Steinau-Steinr{\"u}ck, Robert and H{\"o}ltge, Clara},
  title     = {Krieg in Europa},
  series = {NJW spezial},
  volume    = {19},
  journal   = {NJW spezial},
  number    = {8},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {242 -- 243},
  year      = {2022},
  abstract  = {Am 24.2.2022 begann der russische Angriffskrieg in der Ukraine. Seitdem fliehen t{\"a}glich zahlreiche ukrainische Staatsb{\"u}rger in die Europ{\"a}ische Union, viele davon nach Deutschland. Vorrangig ist jetzt die Sicherung der Grundbed{\"u}rfnisse, wie Verpflegung, Unterkunft und medizinischer Versorgung. Daneben fragen sich Arbeitgeber, wie sie ukrainische Staatsb{\"u}rger m{\"o}glichst schnell besch{\"a}ftigen k{\"o}nnen. Wir geben einen {\"U}berblick {\"u}ber die M{\"o}glichkeiten, ukrainische Gefl{\"u}chtete m{\"o}glichst schnell in den deutschen Arbeitsmarkt zu integrieren.},
  language  = {de}
}
@article{vonSteinauSteinrueckBeismann2020,
  author    = {von Steinau-Steinr{\"u}ck, Robert and Beismann, Lukas},
  title     = {(Corona-)Homeoffice und betriebliche {\"U}bung},
  series = {NJW spezial},
  volume    = {17},
  journal   = {NJW spezial},
  number    = {20},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {626 -- 627},
  year      = {2020},
  abstract  = {Homeoffice und mobiles Arbeiten haben sich infolge der Covid-19-Pandemie bei vielen Unternehmen bekanntlich etabliert. Die Anweisung bzw. „Duldung" des Homeoffice beruhte allerdings meist mehr auf tats{\"a}chlicher als auf rechtlicher Grundlage. Letztere k{\"o}nnte aber aus betrieblicher {\"U}bung erwachsen. Dieser Beitrag geht dem rechtlichen Rahmen daf{\"u}r nach.},
  language  = {de}
}
@article{vonSteinauSteinrueck2021,
  author    = {von Steinau-Steinr{\"u}ck, Robert},
  title     = {Was ist bei "Workation" und "Bleisure" rechtlich zu beachten?},
  series = {NJW spezial},
  volume    = {18},
  journal   = {NJW spezial},
  number    = {20},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {626 -- 627},
  year      = {2021},
  abstract  = {Die Digitalisierung unseres Lebens l{\"o}st die Grenzen zwischen Privat- und Berufsleben immer weiter auf. Bekanntes Beispiel ist das Homeoffice. Arbeitgeber begegnen aber auch zahlreichen weiteren Trends in diesem Zusammenhang. Dazu geh{\"o}ren „workation", also die Verbindung zwischen Arbeit („work") und Urlaub („vacation") ebenso wie „bleisure", dh die Verbindung von Dienstreisen („business") und Urlaub („leisure"). Der Beitrag geht den rechtlichen Rahmenbedingungen hierf{\"u}r nach.},
  language  = {de}
}
@article{vonSteinauSteinrueckJoeris2020,
  author    = {von Steinau-Steinr{\"u}ck, Robert and J{\"o}ris, Nils},
  title     = {Arbeitsschutz bei Corona},
  series = {NJW spezial},
  volume    = {17},
  journal   = {NJW spezial},
  number    = {12},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {370 -- 371},
  year      = {2020},
  abstract  = {Den {\"U}berblick im Arbeitsschutzrecht zu behalten, ist schwierig. Der Arbeitsschutz spielt sich in unterschiedlichen Bereichen und auf verschiedenen Ebenen ab. Außerdem sind die einschl{\"a}gigen Rechtsnormen {\"u}beraus ver{\"a}stelt. Der folgende Beitrag soll daher zur Entwirrung beitragen.},
  language  = {de}
}
@misc{vonSteinauSteinrueck2020,
  author    = {von Steinau-Steinr{\"u}ck, Robert},
  title     = {Gesetzesentwurf zu Corona-bedingten {\"A}nderungen des ArbGG/SGG},
  series = {NJW spezial},
  volume    = {17},
  journal   = {NJW spezial},
  number    = {11},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {340 -- 340},
  year      = {2020},
  language  = {de}
}
@misc{vonSteinauSteinrueck2020,
  author    = {von Steinau-Steinr{\"u}ck, Robert},
  title     = {Koalitionsausschuss beschließt Verl{\"a}ngerung des Kurzarbeitergelds},
  series = {NJW spezial},
  volume    = {17},
  journal   = {NJW spezial},
  number    = {19},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {596 -- 596},
  year      = {2020},
  language  = {de}
}
@misc{HesseMatthiesSinzigetal.2019,
  author    = {Hesse, G{\"u}nter and Matthies, Christoph and Sinzig, Werner and Uflacker, Matthias},
  title     = {Adding Value by Combining Business and Sensor Data},
  series = {Database Systems for Advanced Applications},
  volume    = {11448},
  journal   = {Database Systems for Advanced Applications},
  publisher = {Springer},
  address   = {Cham},
  isbn      = {978-3-030-18590-9},
  issn      = {0302-9743},
  doi       = {10.1007/978-3-030-18590-9_80},
  pages     = {528 -- 532},
  year      = {2019},
  abstract  = {Industry 4.0 and the Internet of Things are recent developments that have lead to the creation of new kinds of manufacturing data. Linking this new kind of sensor data to traditional business information is crucial for enterprises to take advantage of the data's full potential. In this paper, we present a demo which allows experiencing this data integration, both vertically between technical and business contexts and horizontally along the value chain. The tool simulates a manufacturing company, continuously producing both business and sensor data, and supports issuing ad-hoc queries that answer specific questions related to the business. In order to adapt to different environments, users can configure sensor characteristics to their needs.},
  language  = {en}
}
@book{SchneiderLambersOrejas2017,
  author    = {Schneider, Sven and Lambers, Leen and Orejas, Fernando},
  title     = {Symbolic model generation for graph properties},
  number    = {115},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-396-1},
  issn      = {1613-5652},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-103171},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {48},
  year      = {2017},
  abstract  = {Graphs are ubiquitous in Computer Science. For this reason, in many areas, it is very important to have the means to express and reason about graph properties. In particular, we want to be able to check automatically if a given graph property is satisfiable. Actually, in most application scenarios it is desirable to be able to explore graphs satisfying the graph property if they exist or even to get a complete and compact overview of the graphs satisfying the graph property. We show that the tableau-based reasoning method for graph properties as introduced by Lambers and Orejas paves the way for a symbolic model generation algorithm for graph properties. Graph properties are formulated in a dedicated logic making use of graphs and graph morphisms, which is equivalent to firstorder logic on graphs as introduced by Courcelle. Our parallelizable algorithm gradually generates a finite set of so-called symbolic models, where each symbolic model describes a set of finite graphs (i.e., finite models) satisfying the graph property. The set of symbolic models jointly describes all finite models for the graph property (complete) and does not describe any finite graph violating the graph property (sound). Moreover, no symbolic model is already covered by another one (compact). Finally, the algorithm is able to generate from each symbolic model a minimal finite model immediately and allows for an exploration of further finite models. The algorithm is implemented in the new tool AutoGraph.},
  language  = {en}
}
@book{KlauckMaschlerTausche2017,
  author    = {Klauck, Stefan and Maschler, Fabian and Tausche, Karsten},
  title     = {Proceedings of the Fourth HPI Cloud Symposium "Operating the Cloud" 2016},
  number    = {117},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-401-2},
  issn      = {1613-5652},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-394513},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {32},
  year      = {2017},
  abstract  = {Every year, the Hasso Plattner Institute (HPI) invites guests from industry and academia to a collaborative scientific workshop on the topic Every year, the Hasso Plattner Institute (HPI) invites guests from industry and academia to a collaborative scientific workshop on the topic "Operating the Cloud". Our goal is to provide a forum for the exchange of knowledge and experience between industry and academia. Co-located with the event is the HPI's Future SOC Lab day, which offers an additional attractive and conducive environment for scientific and industry related discussions. "Operating the Cloud" aims to be a platform for productive interactions of innovative ideas, visions, and upcoming technologies in the field of cloud operation and administration. On the occasion of this symposium we called for submissions of research papers and practitioner's reports. A compilation of the research papers realized during the fourth HPI cloud symposium "Operating the Cloud" 2016 are published in this proceedings. We thank the authors for exciting presentations and insights into their current work and research. Moreover, we look forward to more interesting submissions for the upcoming symposium later in the year. Every year, the Hasso Plattner Institute (HPI) invites guests from industry and academia to a collaborative scientific workshop on the topic "Operating the Cloud". Our goal is to provide a forum for the exchange of knowledge and experience between industry and academia. Co-located with the event is the HPI's Future SOC Lab day, which offers an additional attractive and conducive environment for scientific and industry related discussions. "Operating the Cloud" aims to be a platform for productive interactions of innovative ideas, visions, and upcoming technologies in the field of cloud operation and administration.},
  language  = {en}
}
@book{DyckGieseLambers2017,
  author    = {Dyck, Johannes and Giese, Holger and Lambers, Leen},
  title     = {Automatic verification of behavior preservation at the transformation level for relational model transformation},
  number    = {112},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-391-6},
  issn      = {1613-5652},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-100279},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {viii, 112},
  year      = {2017},
  abstract  = {The correctness of model transformations is a crucial element for model-driven engineering of high quality software. In particular, behavior preservation is the most important correctness property avoiding the introduction of semantic errors during the model-driven engineering process. Behavior preservation verification techniques either show that specific properties are preserved, or more generally and complex, they show some kind of behavioral equivalence or refinement between source and target model of the transformation. Both kinds of behavior preservation verification goals have been presented with automatic tool support for the instance level, i.e. for a given source and target model specified by the model transformation. However, up until now there is no automatic verification approach available at the transformation level, i.e. for all source and target models specified by the model transformation. In this report, we extend our results presented in [27] and outline a new sophisticated approach for the automatic verification of behavior preservation captured by bisimulation resp. simulation for model transformations specified by triple graph grammars and semantic definitions given by graph transformation rules. In particular, we show that the behavior preservation problem can be reduced to invariant checking for graph transformation and that the resulting checking problem can be addressed by our own invariant checker even for a complex example where a sequence chart is transformed into communicating automata. We further discuss today's limitations of invariant checking for graph transformation and motivate further lines of future work in this direction.},
  language  = {en}
}
@book{BeinBraunDaaseetal.2020,
  author    = {Bein, Leon and Braun, Tom and Daase, Bj{\"o}rn and Emsbach, Elina and Matthes, Leon and Stiede, Maximilian and Taeumel, Marcel and Mattis, Toni and Ramson, Stefan and Rein, Patrick and Hirschfeld, Robert and M{\"o}nig, Jens},
  title     = {SandBlocks},
  number    = {132},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-482-1},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-43926},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-439263},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {viii, 212},
  year      = {2020},
  abstract  = {Visuelle Programmiersprachen werden heutzutage zugunsten textueller Programmiersprachen nahezu nicht verwendet, obwohl visuelle Programmiersprachen einige Vorteile bieten. Diese reichen von der Vermeidung von Syntaxfehlern, {\"u}ber die Nutzung konkreter dom{\"a}nenspezifischer Notation bis hin zu besserer Lesbarkeit und Wartbarkeit des Programms. Trotzdem greifen professionelle Softwareentwickler nahezu ausschließlich auf textuelle Programmiersprachen zur{\"u}ck. Damit Entwickler diese Vorteile visueller Programmiersprachen nutzen k{\"o}nnen, aber trotzdem nicht auf die ihnen bekannten textuellen Programmiersprachen verzichten m{\"u}ssen, gibt es die Idee, textuelle und visuelle Programmelemente gemeinsam in einer Programmiersprache nutzbar zu machen. Damit ist dem Entwickler {\"u}berlassen wann und wie er visuelle Elemente in seinem Programmcode verwendet. Diese Arbeit stellt das SandBlocks-Framework vor, das diese gemeinsame Nutzung visueller und textueller Programmelemente erm{\"o}glicht. Neben einer Auswertung visueller Programmiersprachen, zeigt es die technische Integration visueller Programmelemente in das Squeak/Smalltalk-System auf, gibt Einblicke in die Umsetzung und Verwendung in Live-Programmiersystemen und diskutiert ihre Verwendung in unterschiedlichen Dom{\"a}nen.},
  language  = {de}
}
@book{WeyandChromikWolfetal.2017,
  author    = {Weyand, Christopher and Chromik, Jonas and Wolf, Lennard and K{\"o}tte, Steffen and Haase, Konstantin and Felgentreff, Tim and Lincke, Jens and Hirschfeld, Robert},
  title     = {Improving hosted continuous integration services},
  number    = {108},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-377-0},
  issn      = {1613-5652},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-94251},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {viii, 114},
  year      = {2017},
  abstract  = {Developing large software projects is a complicated task and can be demanding for developers. Continuous integration is common practice for reducing complexity. By integrating and testing changes often, changesets are kept small and therefore easily comprehensible. Travis CI is a service that offers continuous integration and continuous deployment in the cloud. Software projects are build, tested, and deployed using the Travis CI infrastructure without interrupting the development process. This report describes how Travis CI works, presents how time-driven, periodic building is implemented as well as how CI data visualization can be done, and proposes a way of dealing with dependency problems.},
  language  = {en}
}
@inproceedings{DennertMoellerGarmannKujathetal.2016,
  author    = {Dennert-M{\"o}ller, Elisabeth and Garmann, Robert and Kujath, Bertold and Zscheyge, Oliver and Weicker, Karsten and B{\"o}hne, Sebastian and Knobelsdorf, Maria and Kreitz, Christoph and Steen, Alexander and Wisniewski, Max and Benzm{\"u}ller, Christoph and Gebhardt, Kai and Ehlenz, Matthias and Bergner, Nadine and Schroeder, Ulrik},
  title     = {Hochschuldidaktik der Informatik},
  editor    = {Schwill, Andreas and Lucke, Ulrike},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-376-3},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-93511},
  pages     = {102},
  year      = {2016},
  abstract  = {Die 7. Fachtagung f{\"u}r Hochschuldidaktik, die 2016 erneut mit der DeLFI E-Learning Fachtagung Informatik stattfand, setzte das erfolgreiche Modell einer Tagung fort, die sich mit hochschuldidaktischen Fragen und der Gestaltung von Studieng{\"a}ngen der Informatik besch{\"a}ftigt. Thema der Tagung waren alle Fragen, die sich der Vermittlung von Informatikgegenst{\"a}nden im Hochschulbereich widmen. Dazu geh{\"o}rten u.a.: • fachdidaktische Konzepte der Vermittlung einzelner Informatikgegenst{\"a}nde • methodische L{\"o}sungen, wie spezielle Lehr- und Lernformen, Durchf{\"u}hrungskonzepte • empirische Ergebnisse und Vergleichsstudien • E-Learning-Ans{\"a}tze, wenn sie ein erkennbares didaktisches Konzept verfolgen • Studienkonzepte und Curricula, organisatorische Fragen, wie Gewinnung von Studierenden, Studieneingangsphase, Abbrecher. Die Fachtagung widmete sich ausgew{\"a}hlten Fragestellungen dieses Themenkomplexes, die durch Vortr{\"a}ge ausgewiesener Experten, durch eingereichte Beitr{\"a}ge und durch Pr{\"a}sentationen und Poster intensiv behandelt wurden. Unser besonderer Dank gilt dem Programmkomitee und den hier nicht genannten Helfern f{\"u}r ihren Einsatz bei der Vorbereitung und Durchf{\"u}hrung der Tagung.},
  language  = {de}
}
@book{TessenowFelgentreffBrachaetal.2016,
  author    = {Tessenow, Philipp and Felgentreff, Tim and Bracha, Gilad and Hirschfeld, Robert},
  title     = {Extending a dynamic programming language and runtime environment with access control},
  number    = {107},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-373-2},
  issn      = {1613-5652},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-92560},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {83},
  year      = {2016},
  abstract  = {Complexity in software systems is a major factor driving development and maintenance costs. To master this complexity, software is divided into modules that can be developed and tested separately. In order to support this separation of modules, each module should provide a clean and concise public interface. Therefore, the ability to selectively hide functionality using access control is an important feature in a programming language intended for complex software systems. Software systems are increasingly distributed, adding not only to their inherent complexity, but also presenting security challenges. The object-capability approach addresses these challenges by defining language properties providing only minimal capabilities to objects. One programming language that is based on the object-capability approach is Newspeak, a dynamic programming language designed for modularity and security. The Newspeak specification describes access control as one of Newspeak's properties, because it is a requirement for the object-capability approach. However, access control, as defined in the Newspeak specification, is currently not enforced in its implementation. This work introduces an access control implementation for Newspeak, enabling the security of object-capabilities and enhancing modularity. We describe our implementation of access control for Newspeak. We adapted the runtime environment, the reflective system, the compiler toolchain, and the virtual machine. Finally, we describe a migration strategy for the existing Newspeak code base, so that our access control implementation can be integrated with minimal effort.},
  language  = {en}
}
@book{FeinbubeRichterGerstenbergetal.2016,
  author    = {Feinbube, Lena and Richter, Daniel and Gerstenberg, Sebastian and Siegler, Patrick and Haller, Angelo and Polze, Andreas},
  title     = {Software-Fehlerinjektion},
  number    = {109},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-386-2},
  issn      = {1613-5652},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-97435},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {viii, 47},
  year      = {2016},
  abstract  = {Fehlerinjektion ist ein essentielles Werkzeug, um die Fehlertoleranz komplexer Softwaresysteme experimentell zu evaluieren. Wir berichten {\"u}ber das Seminar zum Thema Software-Fehlerinjektion, das am Fachgebiet f{\"u}r Betriebssysteme und Middleware am Hasso-Plattner-Institut der Universit{\"a}t Potsdam im Sommersemester 2015 stattfand. In dem Seminar ging es darum, verschiedene Fehlerinjektionsans{\"a}tze und -werkzeuge anzuwenden und hinsichtlich ihrer Anwendbarkeit in verschiedenen Szenarien zu bewerten. In diesem Bericht werden die studierten Ans{\"a}tze vorgestellt und verglichen.},
  language  = {de}
}
@book{BeckmannHildebrandJascheketal.2019,
  author    = {Beckmann, Tom and Hildebrand, Justus and Jaschek, Corinna and Krebs, Eva and L{\"o}ser, Alexander and Taeumel, Marcel and Pape, Tobias and Fister, Lasse and Hirschfeld, Robert},
  title     = {The font engineering platform},
  number    = {128},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-464-7},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-42748},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-427487},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {viii, 115},
  year      = {2019},
  abstract  = {Creating fonts is a complex task that requires expert knowledge in a variety of domains. Often, this knowledge is not held by a single person, but spread across a number of domain experts. A central concept needed for designing fonts is the glyph, an elemental symbol representing a readable character. Required domains include designing glyph shapes, engineering rules to combine glyphs for complex scripts and checking legibility. This process is most often iterative and requires communication in all directions. This report outlines a platform that aims to enhance the means of communication, describes our prototyping process, discusses complex font rendering and editing in a live environment and an approach to generate code based on a user's live-edits.},
  language  = {en}
}
@book{SchneiderLambersOrejas2019,
  author    = {Schneider, Sven and Lambers, Leen and Orejas, Fernando},
  title     = {A logic-based incremental approach to graph repair},
  number    = {126},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-462-3},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-42751},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-427517},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {34},
  year      = {2019},
  abstract  = {Graph repair, restoring consistency of a graph, plays a prominent role in several areas of computer science and beyond: For example, in model-driven engineering, the abstract syntax of models is usually encoded using graphs. Flexible edit operations temporarily create inconsistent graphs not representing a valid model, thus requiring graph repair. Similarly, in graph databases—managing the storage and manipulation of graph data—updates may cause that a given database does not satisfy some integrity constraints, requiring also graph repair. We present a logic-based incremental approach to graph repair, generating a sound and complete (upon termination) overview of least-changing repairs. In our context, we formalize consistency by so-called graph conditions being equivalent to first-order logic on graphs. We present two kind of repair algorithms: State-based repair restores consistency independent of the graph update history, whereas deltabased (or incremental) repair takes this history explicitly into account. Technically, our algorithms rely on an existing model generation algorithm for graph conditions implemented in AutoGraph. Moreover, the delta-based approach uses the new concept of satisfaction (ST) trees for encoding if and how a graph satisfies a graph condition. We then demonstrate how to manipulate these STs incrementally with respect to a graph update.},
  language  = {en}
}