default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQuang Loc Le
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c25]Wenhua Li, Quang Loc Le, Yahui Song, Wei-Ngan Chin:
Incorrectness Proofs for Object-Oriented Programs via Subclass Reflection. APLAS 2023: 269-289- [c24]Quang Loc Le, Xuan-Bach Dinh Le:
An Efficient Cyclic Entailment Procedure in a Fragment of Separation Logic. FoSSaCS 2023: 477-497 - [c23]Tai D. Nguyen, Long H. Pham, Jun Sun, Quang Loc Le:
An Idealist's Approach for Smart Contract Correctness. ICFEM 2023: 11-28 - 2022
- [j2]Quang Loc Le
, Azalea Raad, Jules Villard, Josh Berdine, Derek Dreyer, Peter W. O'Hearn:
Finding real bugs in big programs with incorrectness logic. Proc. ACM Program. Lang. 6(OOPSLA1): 1-27 (2022) - [i8]Quang Loc Le, Jun Sun, Long H. Pham, Shengchao Qin:
S2TD: a Separation Logic Verifier that Supports Reasoning of the Absence and Presence of Bugs. CoRR abs/2209.09327 (2022) - [i7]Quang Loc Le, Xuan-Bach Dinh Le:
An Efficient Cyclic Entailment Procedure in a Fragment of Separation Logic. CoRR abs/2210.00616 (2022) - 2021
- [c22]Xuan-Bach Dinh Le, Quang Loc Le:
ReFixar: Multi-version Reasoning for Automated Repair of Regression Errors. ISSRE 2021: 162-172 - [c21]Quang Loc Le:
Compositional Satisfiability Solving in Separation Logic. VMCAI 2021: 578-602 - 2020
- [i6]Christopher Curry, Quang Loc Le:
Bi-Abduction for Shapes with Ordered Data. CoRR abs/2006.10439 (2020)
2010 – 2019
- 2019
- [c20]Long H. Pham, Jun Sun, Quang Loc Le:
Compositional Verification of Heap-Manipulating Programs Through Property-Guided Learning. APLAS 2019: 405-424 - [c19]Long H. Pham, Quang Loc Le, Quoc-Sang Phan, Jun Sun, Shengchao Qin:
Enhancing Symbolic Execution of Heap-Based Programs with Separation Logic for Test Input Generation. ATVA 2019: 209-227 - [c18]Long H. Pham, Quang Loc Le, Quoc-Sang Phan, Jun Sun:
Concolic Testing Heap-Manipulating Programs. FM 2019: 442-461 - [c17]Christopher Curry, Quang Loc Le, Shengchao Qin:
Bi-Abductive Inference for Shape and Ordering Properties. ICECCS 2019: 220-225 - [c16]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 - [i5]Long H. Pham, Quang Loc Le, Quoc-Sang Phan, Jun Sun:
Concolic Testing Heap-Manipulating Programs. CoRR abs/1907.05637 (2019) - [i4]Long H. Pham, Jun Sun, Quang Loc Le:
Compositional Verification of Heap-Manipulating Programs through Property-Guided Learning. CoRR abs/1908.10051 (2019) - 2018
- [j1]Guolong Zheng, Quang Loc Le, ThanhVu Nguyen, Quoc-Sang Phan:
Automatic Data Structure Repair usingSeparation Logic. ACM SIGSOFT Softw. Eng. Notes 43(4): 66 (2018) - [c15]Quang Loc Le, Mengda He:
A Decision Procedure for String Logic with Quadratic Equations, Regular Expressions and Length Constraints. APLAS 2018: 350-372 - [c14]Long H. Pham, Quang Loc Le, Quoc-Sang Phan, Jun Sun, Shengchao Qin:
Testing heap-based programs with Java StarFinder. ICSE (Companion Volume) 2018: 268-269 - [c13]Quang Loc Le, Jun Sun, Shengchao Qin:
Frame Inference for Inductive Entailment Proofs in Separation Logic. TACAS (1) 2018: 41-60 - [i3]Quang Loc Le:
Decidable Logics Combining Word Equations, Regular Expressions and Length Constraints. CoRR abs/1805.09123 (2018) - 2017
- [c12]Quang Loc Le, Makoto Tatsuta, Jun Sun, Wei-Ngan Chin:
A Decidable Fragment in Separation Logic with Inductive Predicates and Arithmetic. CAV (2) 2017: 495-517 - [c11]Jiaying Li, Jun Sun, Li Li, Quang Loc Le, Shang-Wei Lin:
Automatic loop-invariant generation and refinement through selective sampling. ASE 2017: 782-792 - [i2]Quang Loc Le:
Enhancing Inductive Entailment Proofs in Separation Logic with Lemma Synthesis. CoRR abs/1710.06515 (2017) - 2016
- [c10]Makoto Tatsuta, Quang Loc Le, Wei-Ngan Chin:
Decision Procedure for Separation Logic with Inductive Definitions and Presburger Arithmetic. APLAS 2016: 423-443 - [c9]Quang Loc Le, Jun Sun, Wei-Ngan Chin:
Satisfiability Modulo Heap-Based Programs. CAV (1) 2016: 382-404 - [c8]Xuan-Bach Dinh Le, Quang Loc Le, David Lo, Claire Le Goues:
Enhancing Automated Program Repair with Deductive Verification. ICSME 2016: 428-432 - [i1]Quang Loc Le:
A Decision Procedure for String Logic with Equations, Regular Membership and Length Constraints. CoRR abs/1610.01331 (2016) - 2014
- [c7]Quang Loc Le, Cristian Gherghina, Shengchao Qin, Wei-Ngan Chin:
Shape Analysis via Second-Order Bi-Abduction. CAV 2014: 52-68 - 2013
- [c6]Minh-Thai Trinh, Quang Loc Le, Cristina David, Wei-Ngan Chin:
Bi-Abduction with Pure Properties for Specification Inference. APLAS 2013: 107-123 - [c5]Quang Loc Le, Asankhaya Sharma, Florin Craciun, Wei-Ngan Chin:
Towards Complete Specifications with an Error Calculus. NASA Formal Methods 2013: 291-306 - 2011
- [c4]Wei-Ngan Chin, Cristian Gherghina, Razvan Voicu, Quang Loc Le, Florin Craciun, Shengchao Qin:
A Specialization Calculus for Pruning Disjunctive Predicates to Support Verification. CAV 2011: 293-309 - 2010
- [c3]Ninh D. Pham, Quang Loc Le, Tran Khanh Dang:
HOT aSAX: A Novel Adaptive Symbolic Representation for Time Series Discords Discovery. ACIIDS (1) 2010: 113-121 - [c2]Ninh D. Pham, Quang Loc Le, Tran Khanh Dang:
Two Novel Adaptive Symbolic Representations for Similarity Search in Time Series Databases. APWeb 2010: 181-187
2000 – 2009
- 2009
- [c1]Quang Loc Le, Tran Khanh Dang:
BiB+-tree: an efficient multiversion access method for bitemporal databases. iiWAS 2009: 193-200
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-12 21:01 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:
