Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShufang Zhu 0001
Person information
- affiliation: Sapienza University of Rome, Italy
- affiliation (former): East China Normal University, School of Computer Science and Software Engineering, Shanghai, China
Other persons with the same name
- Shufang Zhu — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j3]Giuseppe De Giacomo, Dror Fried, Fabio Patrizi, Shufang Zhu:
Mimicking Behaviors in Separated Domains. J. Artif. Intell. Res. 77: 1087-1112 (2023)- [c17]Giuseppe De Giacomo, Gianmarco Parretti, Shufang Zhu:
Symbolic sc ltlf Best-Effort Synthesis. EUMAS 2023: 228-243 - [c16]Benjamin Aminof, Giuseppe De Giacomo, Antonio Di Stasio, Hugo Francon, Sasha Rubin, Shufang Zhu:
sc ltlf Synthesis Under Environment Specifications for Reachability and Safety Properties. EUMAS 2023: 263-279 - [i11]Shufang Zhu
, Giuseppe De Giacomo:
Act for Your Duties but Maintain Your Rights. CoRR abs/2302.03384 (2023) - [i10]Giuseppe De Giacomo, Gianmarco Parretti, Shufang Zhu:
Symbolic LTLf Best-Effort Synthesis. CoRR abs/2308.15178 (2023) - [i9]Benjamin Aminof, Giuseppe De Giacomo, Antonio Di Stasio, Hugo Francon, Sasha Rubin, Shufang Zhu:
LTLf Synthesis Under Environment Specifications for Reachability and Safety Properties. CoRR abs/2308.15184 (2023) - [i8]Giuseppe De Giacomo, Gianmarco Parretti, Shufang Zhu:
LTLf Best-Effort Synthesis in Nondeterministic Planning Domains. CoRR abs/2308.15188 (2023) - 2022
- [c15]Giuseppe De Giacomo, Marco Favorito, Jianwen Li, Moshe Y. Vardi, Shengping Xiao, Shufang Zhu:
LTLf Synthesis as AND-OR Graph Search: Knowledge Compilation at Work. IJCAI 2022: 2591-2598 - [c14]Shufang Zhu, Giuseppe De Giacomo:
Synthesis of Maximally Permissive Strategies for LTLf Specifications. IJCAI 2022: 2783-2789 - [c13]Shufang Zhu, Giuseppe De Giacomo:
Act for Your Duties but Maintain Your Rights. KR 2022 - [c12]Suguman Bansal, Giuseppe De Giacomo, Antonio Di Stasio, Yong Li, Moshe Y. Vardi, Shufang Zhu:
Compositional Safety LTL Synthesis. VSTTE 2022: 1-19 - [i7]Giuseppe De Giacomo, Dror Fried, Fabio Patrizi, Shufang Zhu:
Mimicking Behaviors in Separated Domains. CoRR abs/2205.09201 (2022) - 2021
- [c11]Shengping Xiao, Jianwen Li, Shufang Zhu, Yingying Shi, Geguang Pu, Moshe Y. Vardi:
On-the-fly Synthesis for LTL over Finite Traces. AAAI 2021: 6530-6537 - [c10]Giuseppe De Giacomo, Antonio Di Stasio, Lucas M. Tabajara, Moshe Y. Vardi, Shufang Zhu:
Finite-Trace and Generalized-Reactivity Specifications in Temporal Synthesis. IJCAI 2021: 1852-1858 - [c9]Giuseppe De Giacomo, Antonio Di Stasio, Giuseppe Perelli, Shufang Zhu:
Synthesis with Mandatory Stop Actions. KR 2021: 237-246 - [c8]Shufang Zhu, Lucas M. Tabajara, Geguang Pu, Moshe Y. Vardi:
On the Power of Automata Minimization in Temporal Synthesis. GandALF 2021: 117-134 - 2020
- [c7]Shufang Zhu, Giuseppe De Giacomo, Geguang Pu, Moshe Y. Vardi:
LTLƒ Synthesis with Fairness and Stability Assumptions. AAAI 2020: 3088-3095 - [c6]Giuseppe De Giacomo, Antonio Di Stasio, Moshe Y. Vardi, Shufang Zhu:
Two-Stage Technique for LTLf Synthesis Under LTL Assumptions. KR 2020: 304-314
2010 – 2019
- 2019
- [j2]Jianwen Li, Shufang Zhu, Geguang Pu, Lijun Zhang, Moshe Y. Vardi:
SAT-based explicit LTL reasoning and its application to satisfiability checking. Formal Methods Syst. Des. 54(2): 164-190 (2019) - [c5]Shufang Zhu, Geguang Pu, Moshe Y. Vardi:
First-Order vs. Second-Order Encodings for \textsc ltl_f -to-Automata Translation. TAMC 2019: 684-705 - [i6]Shufang Zhu, Geguang Pu, Moshe Y. Vardi:
First-Order vs. Second-Order Encodings for LTLf-to-Automata Translation. CoRR abs/1901.06108 (2019) - [i5]Shufang Zhu, Giuseppe De Giacomo, Geguang Pu, Moshe Y. Vardi:
LTLf Synthesis with Fairness and Stability Assumptions. CoRR abs/1912.07804 (2019) - 2018
- [j1]Jianwen Li, Lijun Zhang, Shufang Zhu, Geguang Pu, Moshe Y. Vardi, Jifeng He:
An explicit transition system construction approach to LTL satisfiability checking. Formal Aspects Comput. 30(2): 193-217 (2018) - 2017
- [c4]Shufang Zhu, Lucas M. Tabajara, Jianwen Li, Geguang Pu, Moshe Y. Vardi:
A Symbolic Approach to Safety ltl Synthesis. Haifa Verification Conference 2017: 147-162 - [c3]Jianwen Li, Shufang Zhu, Yueling Zhang, Geguang Pu, Moshe Y. Vardi:
Safety model checking with complementary approximations. ICCAD 2017: 95-100 - [c2]Shufang Zhu, Lucas M. Tabajara, Jianwen Li, Geguang Pu, Moshe Y. Vardi:
Symbolic LTLf Synthesis. IJCAI 2017: 1362-1369 - [i4]Shufang Zhu, Lucas M. Tabajara, Jianwen Li, Geguang Pu, Moshe Y. Vardi:
Symbolic LTLf Synthesis. CoRR abs/1705.08426 (2017) - [i3]Shufang Zhu, Lucas M. Tabajara, Jianwen Li, Geguang Pu, Moshe Y. Vardi:
A Symbolic Approach to Safety LTL Synthesis. CoRR abs/1709.07495 (2017) - 2016
- [i2]Jianwen Li, Shufang Zhu, Yueling Zhang, Geguang Pu, Moshe Y. Vardi:
Approximate Reachability. CoRR abs/1611.04946 (2016) - 2015
- [c1]Jianwen Li, Shufang Zhu, Geguang Pu, Moshe Y. Vardi:
SAT-Based Explicit LTL Reasoning. Haifa Verification Conference 2015: 209-224 - [i1]Jianwen Li, Shufang Zhu, Geguang Pu, Moshe Y. Vardi:
SAT-based Explicit LTL Reasoning. CoRR abs/1507.02519 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-14 23:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
