Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Arshia Rafieioskouei

dblp:383/5392 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2026
0009-0002-8844-4441ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 50% Embedded and real-time systems · 25% Distributed systems · 25%
Theoretical computer science
1 paper
Automated reasoning and model checking · 50% Logic in computer science · 50%
Artificial intelligence
1 paper
Reinforcement learning · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
multi-agent reinforcement learning
0.912025
HypRL: Reinforcement Learning of Control Policies for Hyperproperties · NeurIPS 2025
Logic in computer science › temporal logic
HyperLTL
0.912025
HypRL: Reinforcement Learning of Control Policies for Hyperproperties · NeurIPS 2025
Automated reasoning and model checking
hyperproperties
0.912025
HypRL: Reinforcement Learning of Control Policies for Hyperproperties · NeurIPS 2025
Embedded and real-time systems
cyber-physical systems
0.812024
Efficient Discovery of Actual Causality Using Abstraction Refinement · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024
Electronic design automation › hardware verification and test
formal verification
0.812024
Efficient Discovery of Actual Causality Using Abstraction Refinement · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024
Electronic design automation › hardware verification and test
hardware verification
0.812024
Efficient Discovery of Actual Causality Using Abstraction Refinement · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024
Distributed systems
root cause analysis
0.812024
Efficient Discovery of Actual Causality Using Abstraction Refinement · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024

Methods — techniques the papers use, named apart from their topics

skolemization · 1.7reward shaping · 1.7quantitative robustness functions · 1.7satisfiability modulo theories · 0.8abstraction refinement · 0.8
YearPublicationVenuePosition
2026 Efficient Discovery of Actual Causality in Stochastic Systems
Arshia Rafieioskouei, Kenneth Rogale, Borzoo Bonakdarpour
VMCAI1
2025 HypRL: Reinforcement Learning of Control Policies for Hyperproperties
abstract
Reward shaping in multi-agent reinforcement learning (MARL) for complex tasks remains a significant challenge. Existing approaches often fail to find optimal solutions or cannot efficiently handle such tasks. We propose HypRL, a specification-guided reinforcement learning framework that learns control policies w.r.t. hyperproperties expressed in HyperLTL. Hyperproperties constitute a powerful formalism for specifying objectives and constraints over sets of execution traces across agents. To learn policies that maximize the satisfaction of a HyperLTL formula $\varphi$, we apply Skolemization to manage quantifier alternations and define quantitative robustness functions to shape rewards over execution traces of a Markov decision process with unknown transitions. A suitable RL algorithm is then used to learn policies that collectively maximize the expected reward and, consequently, increase the probability of satisfying $\varphi$. We evaluate HypRL on a diverse set of benchmarks, including safety-aware planning, Deep Sea Treasure, and the Post Correspondence Problem. We also compare with specification-driven baselines to demonstrate the effectiveness and efficiency of HypRL.
Tzu-Han Hsu, Arshia Rafieioskouei, Borzoo Bonakdarpour
NeurIPS2
2024 Efficient Discovery of Actual Causality Using Abstraction Refinement
abstract
Causality is the relationship where one event contributes to the production of another, with the cause being partly responsible for the effect and the effect partly dependent on the cause. In this article, we propose a novel and effective method to formally reason about the causal effect of events in engineered systems, with application for finding the root-cause of safety violations in embedded and cyber-physical systems. We are motivated by the notion of actual causality by Halpern and Pearl, which focuses on the causal effect of particular events rather than type-level causality, which attempts to make general statements about scientific and natural phenomena. Our first contribution is formulating discovery of actual causality in computing systems modeled by transition systems as an satisfiability modulo theory solving problem. Since datasets for causality analysis tend to be large, in order to tackle the scalability problem of automated formal reasoning, our second contribution is a novel technique based on abstraction refinement that allows identifying for actual causes within smaller abstract causal models. We demonstrate the effectiveness of our approach (by several orders of magnitude) using three case studies to find the actual cause of violations of safety in 1) a neural network controller for a mountain car; 2) a controller for a Lunar Lander obtained by reinforcement learning; and 3) an MPC controller for an F-16 autopilot simulator.
Arshia Rafieioskouei, Borzoo Bonakdarpour
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1