default search action
Canh Minh Do
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Canh Minh Do, Kazuhiro Ogata:
Symbolic model checking quantum circuits in Maude. PeerJ Comput. Sci. 10: e2098 (2024) - [c14]Canh Minh Do, Tsubasa Takagi, Kazuhiro Ogata:
A Tableau-Based Approach to Model Checking Linear Temporal Properties. ICFEM 2024: 353-374 - [c13]Canh Minh Do
, Kazuhiro Ogata
Equivalence Checking of Quantum Circuits Based on Dirac Notation in Maude. WRLA 2024: 84-103 - 2023
- [j7]Yati Phyo
A Layered and Parallelized Method of Eventual Model Checking. Inf. 14(7): 384 (2023) - [j6]Duong Dinh Tran
Hybrid post-quantum Transport Layer Security formal analysis in Maude-NPA and its parallel version. PeerJ Comput. Sci. 9: e1556 (2023) - [j5]Canh Minh Do
Optimization Techniques for Model Checking Leads-to Properties in a Stratified Way. ACM Trans. Softw. Eng. Methodol. 32(6): 151:1-151:38 (2023) - [c12]Tsubasa Takagi
Automated Quantum Program Verification in Dynamic Quantum Logic. DaLí 2023: 68-84 - [c11]Canh Minh Do, Kazuhiro Ogata:
Symbolic Model Checking Quantum Circuits in Maude. SEKE 2023: 103-108 - 2022
- [j4]Canh Minh Do
Parallel Specification-Based Testing for Concurrent Programs. IEEE Access 10: 24955-24975 (2022) - [j3]Canh Minh Do
Sequential and Parallel Tools for Model Checking Conditional Stable Properties in a Layered Way. IEEE Access 10: 133749-133765 (2022) - [j2]Yati Phyo
A Divide & Conquer Approach to Leads-to Model Checking. Comput. J. 65(6): 1353-1364 (2022) - [c10]Moe Nandi Aung, Yati Phyo
A Tool for Model Checking Eventual Model Checking in a Stratified Way. DSA 2022: 270-279 - [c9]Duong Dinh Tran, Canh Minh Do, Santiago Escobar, Kazuhiro Ogata:
Hybrid Post-Quantum TLS formal specification in Maude-NPA - toward its security analysis. FAVPQC@ICFEM 2022: 50-64 - [c8]Canh Minh Do, Yati Phyo
A divide and conquer approach to until and until stable model checking. SEKE 2022: 388-393 - [c7]Canh Minh Do
Parallel Maude-NPA for Cryptographic Protocol Analysis. WRLA@ETAPS 2022: 253-273 - 2021
- [j1]Thet Wai Mon, Dang Duy Bui, Duong Dinh Tran, Canh Minh Do, Kazuhiro Ogata:
Graphical Animations of the NS(L)PK Authentication Protocols. J. Vis. Lang. Comput. 2021(2): 39-51 (2021) - [c6]Yati Phyo
A support tool for the L + 1-layer divide & conquer approach to leads-to model checking. COMPSAC 2021: 854-863 - [c5]Yati Phyo
A Divide & Conquer Approach to Conditional Stable Model Checking. ICTAC 2021: 105-111 - 2020
- [c4]Canh Minh Do
A divide & conquer approach to testing concurrent programs with JPF*. APSEC 2020: 356-364 - [c3]Canh Minh Do
Parallel stratified random testing for concurrent programs. QRS Companion 2020: 79-86
2010 – 2019
- 2019
- [c2]Canh Minh Do
Specification-based Testing with Simulation Relations (S). SEKE 2019: 107-146 - [c1]Canh Minh Do
A Divide & Conquer Approach to Testing Concurrent Java Programs with JPF and Maude. SOFL+MSVL 2019: 42-58
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 19:13 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: