default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTon Chanh Le
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j5]Timos Antonopoulos
, Eric Koskinen, Ton Chanh Le, Ramana Nagasamudram, David A. Naumann, Minh Ngo:
An Algebra of Alignment for Relational Verification. Proc. ACM Program. Lang. 7(POPL): 573-603 (2023)- [i11]Yuandong Cyrus Liu, Ton-Chanh Le, Timos Antonopoulos, Eric Koskinen, ThanhVu Nguyen:
DrNLA: Extending Verification to Non-linear Programs through Dual Re-writing. CoRR abs/2306.15584 (2023) - 2022
- [i10]Timos Antonopoulos, Eric Koskinen, Ton Chanh Le, Ramana Nagasamudram, David A. Naumann, Minh Ngo:
An algebra of alignment for relational verification. CoRR abs/2202.04278 (2022) - 2021
- [c10]Yuandong Cyrus Liu, Chengbin Pang, Daniel Dietsch, Eric Koskinen, Ton-Chanh Le, Georgios Portokalidis, Jun Xu:
Proving LTL Properties of Bitvector Programs and Decompiled Binaries. APLAS 2021: 285-304 - [i9]Yuandong Cyrus Liu, Chengbin Pang, Daniel Dietsch, Eric Koskinen, Ton-Chanh Le, Georgios Portokalidis, Jun Xu:
Source-Level Bitwise Branching for Temporal Verification of Lifted Binaries. CoRR abs/2105.05159 (2021) - [i8]Yuandong Cyrus Liu, Ton-Chanh Le, Eric Koskinen:
Source-Level Bitwise Branching for Temporal Verification. CoRR abs/2111.02938 (2021) - 2020
- [j4]Ton Chanh Le, Timos Antonopoulos, Parisa Fathololumi, Eric Koskinen, ThanhVu Nguyen:
DynamiTe: dynamic termination and non-termination proofs. Proc. ACM Program. Lang. 4(OOPSLA): 189:1-189:30 (2020) - [i7]Ton Chanh Le, Timos Antonopoulos, Parisa Fathololumi, Eric Koskinen, ThanhVu Nguyen:
DynamiTe: Dynamic Termination and Non-termination Proofs. CoRR abs/2010.05747 (2020)
2010 – 2019
- 2019
- [j3]Quang-Trung Ta, Ton Chanh Le, Siau-Cheng Khoo, Wei-Ngan Chin:
Automated mutual induction proof in separation logic. Formal Aspects Comput. 31(2): 207-230 (2019) - [j2]Timos Antonopoulos, Eric Koskinen, Ton Chanh Le:
Specification and inference of trace refinement relations. Proc. ACM Program. Lang. 3(OOPSLA): 178:1-178:30 (2019) - [c9]Ton Chanh Le, Guolong Zheng, ThanhVu Nguyen:
SLING: using dynamic analysis to infer program invariants in separation logic. PLDI 2019: 788-801 - [c8]Mihaela Sighireanu, Juan Antonio Navarro Pérez, Andrey Rybalchenko, Nikos Gorogiannis, Radu Iosif, Andrew Reynolds, Cristina Serban, Jens Katelaan, Christoph Matheja, Thomas Noll, Florian Zuleger, Wei-Ngan Chin, Quang Loc Le, Quang-Trung Ta, Ton-Chanh Le, Thanh-Toan Nguyen, Siau-Cheng Khoo, Michal Cyprian, Adam Rogalewicz, Tomás Vojnar, Constantin Enea, Ondrej Lengál, Chong Gao, Zhilin Wu:
SL-COMP: Competition of Solvers for Separation Logic. TACAS (3) 2019: 116-132 - [i6]Timos Antonopoulos, Eric Koskinen, Ton-Chanh Le:
Specification and Inference of Trace Refinement Relations. CoRR abs/1903.07213 (2019) - [i5]Ton Chanh Le, Guolong Zheng, ThanhVu Nguyen:
SLING: Using Dynamic Analysis to Infer Program Invariants in Separation Logic. CoRR abs/1903.09713 (2019) - [i4]Wei-Ngan Chin, Ton Chanh Le, Shengchao Qin:
Automated Verification of CountDownLatch. CoRR abs/1908.09758 (2019) - 2018
- [j1]Quang-Trung Ta, Ton Chanh Le, Siau-Cheng Khoo, Wei-Ngan Chin:
Automated lemma synthesis in symbolic-heap separation logic. Proc. ACM Program. Lang. 2(POPL): 9:1-9:29 (2018) - [c7]Ton Chanh Le, Lei Xu, Lin Chen, Weidong Shi:
Proving Conditional Termination for Smart Contracts. BCC@AsiaCCS 2018: 57-59 - [c6]Lin Chen, Lei Xu, Zhimin Gao, Nolan Shah, Ton Chanh Le, Yang Lu, Weidong Shi:
The Game Among Bribers in a Smart Contract System. Financial Cryptography Workshops 2018: 294-307 - 2017
- [c5]Ton Chanh Le, Quang-Trung Ta, Wei-Ngan Chin:
HipTNT+: A Termination and Non-termination Analyzer by Second-Order Abduction - (Competition Contribution). TACAS (2) 2017: 370-374 - [i3]Quang-Trung Ta, Ton Chanh Le, Siau-Cheng Khoo, Wei-Ngan Chin:
Automated Lemma Synthesis in Symbolic-Heap Separation Logic. CoRR abs/1710.09635 (2017) - 2016
- [c4]Quang-Trung Ta, Ton Chanh Le, Siau-Cheng Khoo, Wei-Ngan Chin:
Automated Mutual Explicit Induction Proof in Separation Logic. FM 2016: 659-676 - [i2]Quang-Trung Ta, Ton Chanh Le, Siau-Cheng Khoo, Wei-Ngan Chin:
Automated Mutual Explicit Induction Proof in Separation Logic. CoRR abs/1609.00919 (2016) - 2015
- [c3]Ton Chanh Le, Shengchao Qin, Wei-Ngan Chin:
Termination and non-termination specification inference. PLDI 2015: 489-498 - 2014
- [c2]Ton Chanh Le, Cristian Gherghina, Aquinas Hobor, Wei-Ngan Chin:
A Resource-Based Logic for Termination and Non-termination Proofs. ICFEM 2014: 267-283 - 2013
- [c1]Ton Chanh Le, Cristian Gherghina, Razvan Voicu, Wei-Ngan Chin:
A Proof Slicing Framework for Program Verification. ICFEM 2013: 53-69 - [i1]Ton Chanh Le:
Preliminary Notes on Termination and Non-Termination Reasoning. CoRR abs/1309.3128 (2013)
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-04-25 05:51 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:
