A5078808456- Formal Methods in Verification
- Software Testing and Debugging Techniques
- Model-Driven Software Engineering Techniques
- Machine Learning and Algorithms
- Advanced Software Engineering Methodologies
- Logic, programming, and type systems
- Service-Oriented Architecture and Web Services
- Business Process Modeling and Analysis
- Software Engineering Research
- Scientific Computing and Data Management
- Semantic Web and Ontologies
- semigroups and automata theory
- Optimization and Search Problems
- Parallel Computing and Optimization Techniques
- Software Reliability and Analysis Research
- Embedded Systems Design Techniques
- Software System Performance and Reliability
- Distributed and Parallel Computing Systems
- Petri Nets in System Modeling
- Algorithms and Data Compression
- Evacuation and Crowd Dynamics
- Distributed systems and fault tolerance
- Logic, Reasoning, and Knowledge
- Explainable Artificial Intelligence (XAI)
- Real-Time Systems Scheduling
TU Dortmund University
2016-2025
Forschungszentrum Jülich
2007-2022
RWTH Aachen University
1990-2021
Purdue University West Lafayette
2020-2021
Cornell University
1995-2021
Columbia University
2020-2021
Tsinghua University
2021
Karlsruhe Institute of Technology
2020-2021
Peking University
2020-2021
Green Cross International
2021
The Concurrency Workbench is an automated tool for analyzing networks of finite-state processes expressed in Milner's Calculus Communicating Systems. Its key feature its breadth: a variety different verification methods, including equivalence checking, preorder and model are supported several process semantics. One experience from our work that large number interesting methods can be formulated as combinations small primitive algorithms. has been applied to the communications protocols...
We present a bit-vector algorithm for the optimal and economical placement of computations within flow graphs, which is as efficient standard uni-directional analyses. The point our decomposition bi-directional structure known algorithms into sequence backward forward analysis, directly implies efficiency result. Moreover, new compositional opens modification: two further analysis components exclude any unnecessary code motion. This laziness minimizes register pressure, has drastic effects...
An implementation-oriented algorithm for lazy code motion is presented that minimizes the number of computations in programs while suppressing any unnecessary order to avoid superfluous register pressure. In particular, this variant original works on flowgraphs whose nodes are basic blocks rather than single statements, since format standard optimizing compilers. The theoretical foundations modified given first part, where t -refined introduced simplifying treatment flow graphs blocks....
A new aggressive algorithm for the elimination of partially dead code is presented, i.e., which only on some program paths. Besides being more powerful than usual approaches to elimination, this optimal in following sense: remaining resulting cannot be eliminated without changing branching structure or semantics program, impairing executions.
The motion of pedestrians is subject to a wide range influences and exhibits rich phenomenology. To enable precise measurement the density velocity we use an alternative definition using Voronoi diagrams which smaller fluctuations than standard definitions. This method permits examination on scales pedestrians. We this investigate spatial temporal variation observables at bottlenecks. Experiments were performed with 180 test subjects bottleneck parameters. anomalous flow through short...
Reactive, generative, and stratified models are considered within the framework of PCCS, a specification language for probabilistic processes. A structural operational semantics given as set inference rules each models, notion bisimulation semantics, some conference proofs presented.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>