Shufang Zhu

Orcid: 0000-0002-5922-8750

Affiliations:
  • University of Oxford, UK
  • Sapienza University of Rome, Italy (former)
  • East China Normal University, School of Computer Science and Software Engineering, Shanghai, China (former)


According to our database1, Shufang Zhu authored at least 27 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Mimicking Behaviors in Separated Domains (Abstract Reprint).
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Mimicking Behaviors in Separated Domains.
J. Artif. Intell. Res., 2023

LTLf Best-Effort Synthesis in Nondeterministic Planning Domains.
CoRR, 2023

LTLf Synthesis Under Environment Specifications for Reachability and Safety Properties.
CoRR, 2023

Symbolic LTLf Best-Effort Synthesis.
CoRR, 2023

Symbolic sc ltl<sub>f</sub> Best-Effort Synthesis.
Proceedings of the Multi-Agent Systems - 20th European Conference, 2023

sc ltl<sub>f</sub> Synthesis Under Environment Specifications for Reachability and Safety Properties.
Proceedings of the Multi-Agent Systems - 20th European Conference, 2023

LTL<sub>f</sub> Best-Effort Synthesis in Nondeterministic Planning Domains.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

2022
Finite-trace and generalized-reactivity specifications in temporal synthesis.
Formal Methods Syst. Des., December, 2022

Compositional Safety LTL Synthesis.
Proceedings of the Verified Software. Theories, Tools and Experiments, 2022

Act for Your Duties but Maintain Your Rights.
Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, 2022

LTLf Synthesis as AND-OR Graph Search: Knowledge Compilation at Work.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Synthesis of Maximally Permissive Strategies for LTLf Specifications.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021
On the Power of Automata Minimization in Temporal Synthesis.
Proceedings of the Proceedings 12th International Symposium on Games, 2021

Synthesis with Mandatory Stop Actions.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

On-the-fly Synthesis for LTL over Finite Traces.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Two-Stage Technique for LTLf Synthesis Under LTL Assumptions.
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

LTLƒ Synthesis with Fairness and Stability Assumptions.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
SAT-based explicit LTL reasoning and its application to satisfiability checking.
Formal Methods Syst. Des., 2019

First-Order vs. Second-Order Encodings for LTLf-to-Automata Translation.
CoRR, 2019

First-Order vs. Second-Order Encodings for \textsc ltl_f -to-Automata Translation.
Proceedings of the Theory and Applications of Models of Computation, 2019

2018
An explicit transition system construction approach to LTL satisfiability checking.
Formal Aspects Comput., 2018

2017
Symbolic LTLf Synthesis.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Safety model checking with complementary approximations.
Proceedings of the 2017 IEEE/ACM International Conference on Computer-Aided Design, 2017

A Symbolic Approach to Safety ltl Synthesis.
Proceedings of the Hardware and Software: Verification and Testing, 2017

2016
Approximate Reachability.
CoRR, 2016

2015
SAT-Based Explicit LTL Reasoning.
Proceedings of the Hardware and Software: Verification and Testing, 2015


  Loading...