default search action
Kangfeng Ye
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Kangfeng Ye
, Simon Foster, Jim Woodcock:
Formally verified animation for RoboChart using interaction trees. J. Log. Algebraic Methods Program. 137: 100940 (2024) - [j4]Kangfeng Ye
Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: Semantics and automated reasoning with theorem proving. Theor. Comput. Sci. 1021: 114876 (2024) - [c6]Kangfeng Ye, Roberto Metere, Poonam Yadav:
User-Guided Verification of Security Protocols via Sound Animation. SEFM 2024: 33-51 - [i7]Kangfeng Ye, Fang Yan, Simos Gerasimou:
Quantitative Assurance and Synthesis of Controllers from Activity Diagrams. CoRR abs/2403.00169 (2024) - [i6]Kangfeng Ye, Jim Woodcock:
RoboCertProb: Property Specification for Probabilistic RoboChart Models. CoRR abs/2403.08136 (2024) - [i5]Kangfeng Ye, Roberto Metere, Poonam Yadav:
User-Guided Verification of Security Protocols via Sound Animation. CoRR abs/2410.00676 (2024) - 2023
- [c5]Mustafa Adam, Kangfeng Ye
Probabilistic Modelling and Safety Assurance of an Agriculture Robot Providing Light-Treatment. CASE 2023: 1-7 - [i4]Kangfeng Ye, Simon Foster, Jim Woodcock:
Formally Verified Animation for RoboChart using Interaction Trees. CoRR abs/2303.09106 (2023) - [i3]Kangfeng Ye, Jim Woodcock, Simon Foster:
Probabilistic relations for modelling epistemic and aleatoric uncertainty: its semantics and automated reasoning with theorem proving. CoRR abs/2303.09692 (2023) - 2022
- [j3]Kangfeng Ye
Probabilistic modelling and verification using RoboChart and PRISM. Softw. Syst. Model. 21(2): 667-716 (2022) - [c4]Kangfeng Ye, Simon Foster
Formally Verified Animation for RoboChart Using Interaction Trees. ICFEM 2022: 404-420 - 2021
- [j2]Simon Foster
Automated verification of reactive and concurrent programs by calculation. J. Log. Algebraic Methods Program. 121: 100681 (2021) - [c3]Kangfeng Ye
Automated Reasoning for Probabilistic Sequential Programs with Theorem Proving. RAMiCS 2021: 465-482 - 2020
- [i2]Simon Foster
Automated Verification of Reactive and Concurrent Programs by Calculation. CoRR abs/2007.13529 (2020)
2010 – 2019
- 2019
- [c2]Jim Woodcock
Probabilistic Semantics for RoboChart - A Weakest Completion Approach. UTP 2019: 80-105 - [d1]Simon Foster
Automated Verification of Reactive and Concurrent Programs by Calculation, supporting material. Zenodo, 2019 - 2018
- [c1]Simon Foster
Calculational Verification of Reactive Programs with Reactive Relations and Kleene Algebra. RAMiCS 2018: 205-224 - [i1]Simon Foster, Kangfeng Ye, Ana Cavalcanti, Jim Woodcock:
Calculational Verification of Reactive Programs with Reactive Relations and Kleene Algebra. CoRR abs/1806.02101 (2018) - 2017
- [j1]Kangfeng Ye
Model checking of state-rich formalism Circus by linking to CSP ‖ B. Int. J. Softw. Tools Technol. Transf. 19(1): 73-96 (2017) - 2016
- [b1]Kangfeng Ye
Model checking of state-rich formalisms (by linking to combination of state-based formalism and process algebra). University of York, UK, 2016
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 2024-12-13 20:04 CET 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: