Rose Bohrer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Rose Bohrer has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- André Platzer
Karlsruhe Institute of Technology
7 shared publications Rose Bohrer
7 shared publications- Phoebe O. Toups Dugas
Exertion Games Lab, Monash University, Melbourne, Victoria, Australia
6 shared publications - Shano Liang
Worcester Polytechnic Institute, Worcester, Massachusetts, USA
6 shared publications - Michelle V. Cormier
Exertion Games Laboratory, Monash University, Clayton, Victoria, Australia
5 shared publications Stefan Mitsch
Carnegie Mellon University, USA
2 shared publications
Latest Publications
- Open Access
- 24 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 29-42
CounterChoice: Counterpoint Composition in Dusa with a Firmus Foundation
This paper presents CounterChoice, a mixed-initiative creative application which creates a first-species counterpoint composition together with its user. The user provides the first voice, the cantus firmus, through a graphical interface provided as a web application, and CounterChoice generates the counterpoint voice using a logic program written in the finite-choice logic programming language Dusa. The resulting composition is presented both as playable audio and as Dusa code, at which point the user may continue to edit and revise via the same interaction loop. The CounterChoice experiment serves as both a demonstrator application for the Dusa language and a case-study in the development of domain-specific interfaces for modern logic programming languages, so that creators in those domains may access the full potential of such languages for procedural content generation and exploratory play. We present findings on the suitability of Dusa for encoding the formal rules of counterpoint, the impact of Dusa on the frontend interface, and generalizable design recommendations for developers of logic programming languages with similar applications to Dusa.
- 24 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 29-42
Open AccessCounterChoice: Counterpoint Composition in Dusa with a Firmus Foundation
This paper presents CounterChoice, a mixed-initiative creative application which creates a first-species counterpoint composition together with its user. The user provides the first voice, the cantus firmus, through a graphical interface provided as a web application, and CounterChoice generates the counterpoint voice using a logic program written in the finite-choice logic programming language Dusa. The resulting composition is presented both as playable audio and as Dusa code, at which point the user may continue to edit and revise via the same interaction loop. The CounterChoice experiment serves as both a demonstrator application for the Dusa language and a case-study in the development of domain-specific interfaces for modern logic programming languages, so that creators in those domains may access the full potential of such languages for procedural content generation and exploratory play. We present findings on the suitability of Dusa for encoding the formal rules of counterpoint, the impact of Dusa on the frontend interface, and generalizable design recommendations for developers of logic programming languages with similar applications to Dusa.
- Open Access
- 18 May 2026
- Published by Springer Nature
- p. 337-356
Hybrid Spatiotemporal Logic for Automotive Applications: Modeling and Model-Checking
We introduce a hybrid spatiotemporal logic for automotive safety applications (HSTL), focused on highway driving. Spatiotemporal logic features specifications about vehicles throughout space and time, while hybrid logic enables precise references to individual vehicles and their historical positions. We define the semantics of HSTL and provide a baseline model-checking algorithm for it. We propose two optimized model-checking algorithms, which reduce the search space based on the reachable states and possible transitions from one state to another. All three model-checking algorithms are evaluated on a series of common driving scenarios such as safe following, safe crossings, overtaking, and platooning. An exponential performance improvement is observed for the optimized algorithms.
- 18 May 2026
- Published by Springer Nature
- p. 337-356
Open AccessHybrid Spatiotemporal Logic for Automotive Applications: Modeling and Model-Checking
We introduce a hybrid spatiotemporal logic for automotive safety applications (HSTL), focused on highway driving. Spatiotemporal logic features specifications about vehicles throughout space and time, while hybrid logic enables precise references to individual vehicles and their historical positions. We define the semantics of HSTL and provide a baseline model-checking algorithm for it. We propose two optimized model-checking algorithms, which reduce the search space based on the reachable states and possible transitions from one state to another. All three model-checking algorithms are evaluated on a series of common driving scenarios such as safe following, safe crossings, overtaking, and platooning. An exponential performance improvement is observed for the optimized algorithms.
- 12 May 2026
- Published by Springer Nature
- p. 19-76
Demonic Dynamic Logic Programming
- Open Access
- 25 June 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer-Human Interaction
The Three Steps to Trans Death: Introducing Trans Cyber-Necropolitics in Digital Media
Many trans people experience marginalization and violence in cyberspace. This violence is characterized by intricate dynamics surrounding voice, identities, bodies, and social interactions. To comprehend and provide a theoretical framework for this enduring phenomenon of digital violence, the present research introduces the concept of Trans Cyber-Necropolitics (TCN). TCN is a necropolitical system that explains how digital media enforce the disposability of trans people in cyberspace. We decompose this digital death into three steps: sensing , targeting , and invisible killing . Combining with the authors’ positionality as transgender gamers, we provide a critical analysis of how each step operates, conducted via a meticulous examination of games, as well as an exploration of the discourse from game design and community-side comments through the lens of critical discourse analysis. Building on this analysis, we ideate how each step could be disrupted with resistance strategies and technological measures.
- 25 June 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer-Human Interaction
Open AccessThe Three Steps to Trans Death: Introducing Trans Cyber-Necropolitics in Digital Media
Many trans people experience marginalization and violence in cyberspace. This violence is characterized by intricate dynamics surrounding voice, identities, bodies, and social interactions. To comprehend and provide a theoretical framework for this enduring phenomenon of digital violence, the present research introduces the concept of Trans Cyber-Necropolitics (TCN). TCN is a necropolitical system that explains how digital media enforce the disposability of trans people in cyberspace. We decompose this digital death into three steps: sensing , targeting , and invisible killing . Combining with the authors’ positionality as transgender gamers, we provide a critical analysis of how each step operates, conducted via a meticulous examination of games, as well as an exploration of the discourse from game design and community-side comments through the lens of critical discourse analysis. Building on this analysis, we ideate how each step could be disrupted with resistance strategies and technological measures.
- Open Access
- 25 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-15
This Game SUX: Why & How to Design Sh@*!y User Experiences
- 25 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-15
Open AccessThis Game SUX: Why & How to Design Sh@*!y User Experiences
- Open Access
- 25 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Refeminizing Creative Computing through a Programming Language for Quilts
- 25 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Open AccessRefeminizing Creative Computing through a Programming Language for Quilts
- Open Access
- 25 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Transnational lgbTq+ SIG
- 25 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Open AccessTransnational lgbTq+ SIG
- Open Access
- 25 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-21
Designed & Discovered Euphoria: Insights from Trans-Femme Players' Experiences of Gender Euphoria in Video Games
- 25 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-21
Open AccessDesigned & Discovered Euphoria: Insights from Trans-Femme Players' Experiences of Gender Euphoria in Video Games
- Open Access
- 28 February 2025
- Published by Association for Computing Machinery (ACM) in Games: Research and Practice
The Collaborative Sensemaking Play of Jubensha Games: A Deconstruction, Taxonomy, and Analysis
Jubensha games, popular in China, combine storytelling, social deduction, and script-centered group play, sparking widespread interest among gamers and researchers worldwide. However, enthusiasts and researchers have struggled to accurately describe Jubensha , often defaulting to comparisons with genres like murder mystery and live-action role-playing games. This reliance on comparisons hinders efforts to generalize Jubensha or to deconstruct and adapt its unique design components, dynamics of player interaction, and playing experience into other games. This research provides a taxonomy and analysis of Jubensha games, based on a thematic analysis of over 80 Jubensha games accessed through mobile applications and physical copies. The analysis combines the authors’ positionalities as native Chinese and English speakers and lenses from close reading of the games, discourse analysis, and distributed cognition. We provide summative case studies to exemplify our taxonomy, and discuss design implications for Jubensha games for future projects. Our work provides a descriptive tool and vocabulary for researchers and designers to facilitate communication and theorize the evolving Jubensha gaming phenomenon highlighting how gameplay centers collaborative sensemaking. In addition, we argue that the design of game narratives in Jubensha games, including structures in scripts and the evolving performance of players, can be generalized and transferred to the design of a wider range of analog and video games.
- 28 February 2025
- Published by Association for Computing Machinery (ACM) in Games: Research and Practice
Open AccessThe Collaborative Sensemaking Play of Jubensha Games: A Deconstruction, Taxonomy, and Analysis
Jubensha games, popular in China, combine storytelling, social deduction, and script-centered group play, sparking widespread interest among gamers and researchers worldwide. However, enthusiasts and researchers have struggled to accurately describe Jubensha , often defaulting to comparisons with genres like murder mystery and live-action role-playing games. This reliance on comparisons hinders efforts to generalize Jubensha or to deconstruct and adapt its unique design components, dynamics of player interaction, and playing experience into other games. This research provides a taxonomy and analysis of Jubensha games, based on a thematic analysis of over 80 Jubensha games accessed through mobile applications and physical copies. The analysis combines the authors’ positionalities as native Chinese and English speakers and lenses from close reading of the games, discourse analysis, and distributed cognition. We provide summative case studies to exemplify our taxonomy, and discuss design implications for Jubensha games for future projects. Our work provides a descriptive tool and vocabulary for researchers and designers to facilitate communication and theorize the evolving Jubensha gaming phenomenon highlighting how gameplay centers collaborative sensemaking. In addition, we argue that the design of game narratives in Jubensha games, including structures in scripts and the evolving performance of players, can be generalized and transferred to the design of a wider range of analog and video games.
- Open Access
- 13 February 2025
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 416, 267-273
A Coq Formalization of Unification Modulo Exclusive-Or
Equational Unification is a critical problem in many areas such as automated theorem proving and security protocol analysis. In this paper, we focus on XOR-Unification, that is, unification modulo the theory of exclusive-or. This theory contains an operator with the properties Associativity, Commutativity, Nilpotency, and the presence of an identity. In the proof assistant Coq, we implement an algorithm that solves XOR unification problems, whose design was inspired by Liu and Lynch, and prove it sound, complete, and terminating. Using Coq's code extraction capability we obtain an implementation in the programming language OCaml.
- 13 February 2025
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 416, 267-273
Open AccessA Coq Formalization of Unification Modulo Exclusive-Or
Equational Unification is a critical problem in many areas such as automated theorem proving and security protocol analysis. In this paper, we focus on XOR-Unification, that is, unification modulo the theory of exclusive-or. This theory contains an operator with the properties Associativity, Commutativity, Nilpotency, and the presence of an identity. In the proof assistant Coq, we implement an algorithm that solves XOR unification problems, whose design was inspired by Liu and Lynch, and prove it sound, complete, and terminating. Using Coq's code extraction capability we obtain an implementation in the programming language OCaml.