activity
20132023
most citedTowards Automated Attack Simulations of BPMN-based Processes

8 citations · 30 across the 16 of their papers we have counts for

collaborators

17 papers

cs.SE2023

Responsible Composition and Optimization of Integration Processes under Correctness Preserving Guarantees

Daniel Ritter, Fredrik Nordvall Forsberg, Stefanie Rinderle-Ma

Enterprise Application Integration deals with the problem of connecting heterogeneous applications, and is the centerpiece of current on-premise, cloud and device integration scena…

cs.AR2022★ 1 cited

GraphScale: Scalable Bandwidth-Efficient Graph Processing on FPGAs

Jonas Dann, Daniel Ritter, Holger Fröning

Recent advances in graph processing on FPGAs promise to alleviate performance bottlenecks with irregular memory access patterns. Such bottlenecks challenge performance for a growin…

cs.AI2021

Learning Finite Linear Temporal Logic Specifications with a Specialized Neural Operator

Homer Walke, Daniel Ritter, Carl Trimbach +1

Finite linear temporal logic () is a powerful formal representation for modeling temporal sequences. We address the problem of learning a compact f…

cs.CR2021★ 8 cited

Towards Automated Attack Simulations of BPMN-based Processes

Simon Hacks, Robert Lagerström, Daniel Ritter

Process digitization and integration is an increasing need for enterprises, while cyber-attacks denote a growing threat. Using the Business Process Management Notation (BPMN) is co…

cs.AR2021★ 1 cited

Demystifying Memory Access Patterns of FPGA-Based Graph Processing Accelerators

Jonas Dann, Daniel Ritter, Holger Fröning

Recent advances in reprogrammable hardware (e.g., FPGAs) and memory technology (e.g., DDR4, HBM) promise to solve performance problems inherent to graph processing like irregular m…

cs.DB2020

Exploring Memory Access Patterns for Graph Processing Accelerators

Jonas Dann, Daniel Ritter, Holger Fröning

Recent trends in business and technology (e.g., machine learning, social network analysis) benefit from storing and processing growing amounts of graph-structured data in databases…