Shuanglong Kan
Applied Filters
- Shuanglong Kan
- AuthorRemove filter
People
Colleagues
- Shuanglong Kan (7)
- Anthony Widjaja Lin (2)
- Philipp Rümmer (2)
- Zhe Chen (2)
- Alejandro Flores-Lamas (1)
- David Sanán (1)
- Fuyuan Zhang (1)
- Jean Paul Bodeveix (1)
- Jingling Xue (1)
- Ju Qian (1)
- Junqi Yan (1)
- Mamoun Filali-Amine (1)
- Matthew Hague (1)
- Shangwei Lin (1)
- Taolue Chen (1)
- Xinwen Hu (1)
- Yang Liu (1)
- Yi Zhuang (1)
- Zhilin Wu (1)
- Zining Cao (1)
Publication
Proceedings/Book Names
- CPP 2022: Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs (1)
- FSE 2014: Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering (1)
- ISSTA 2019: Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and Analysis (1)
- MEMOCODE '17: Proceedings of the 15th ACM-IEEE International Conference on Formal Methods and Models for System Design (1)
Publication Date
Export Citations
Publications
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-article
Formally understanding Rust’s ownership and borrowing system at the memory level
- Shuanglong Kan
Department of Computer Science, Technische Universität Kaiserslautern, Kaiserslautern, Germany
, - Zhe Chen
https://ror.org/01scyh794College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China
, - David Sanán
https://ror.org/01v2c2791InfoComm Technology Cluster, Singapore Institute of Technology, Singapore, Singapore
, - Yang Liu
https://ror.org/02e7b5302School of Computer Science and Engineering, Nanyang Technological University, Singapore, Singapore
Formal Methods in System Design, Volume 64, Issue 1•Dec 2024, pp 200-236 • https://doi.org/10.1007/s10703-024-00460-3AbstractRust is an emergent systems programming language highlighting memory safety through its Ownership and Borrowing System (OBS). Formalizing OBS in semantics is essential in certifying Rust’s memory safety guarantees. Existing formalizations of OBS ...
- 0Citation
MetricsTotal Citations0
- Shuanglong Kan
- research-articleOpen AccessPublished By ACMPublished By ACM
Solving string constraints with Regex-dependent functions through transducers with priorities and variables
- Taolue Chen
Birkbeck University of London, UK
, - Alejandro Flores-Lamas
Royal Holloway University of London, UK
, - Matthew Hague
Royal Holloway University of London, UK
, - Zhilei Han
Tsinghua University, China
, - Denghang Hu
Institute of Software at Chinese Academy of Sciences, China / University of Chinese Academy of Sciences, China
, - Shuanglong Kan
TU Kaiserslautern, Germany
, - Anthony W. Lin
TU Kaiserslautern, Germany / MPI-SWS, Germany
, - Philipp Rümmer
Uppsala University, Sweden
, - Zhilin Wu
Institute of Software at Chinese Academy of Sciences, China / University of Chinese Academy of Sciences, China
Proceedings of the ACM on Programming Languages, Volume 6, Issue POPL•January 2022, Article No.: 45, pp 1-31 • https://doi.org/10.1145/3498707Regular expressions are a classical concept in formal language theory. Regular expressions in programming languages (RegEx) such as JavaScript, feature non-standard semantics of operators (e.g. greedy/lazy Kleene star), as well as additional features ...
- 16Citation
- 1,041
- Downloads
MetricsTotal Citations16Total Downloads1,041Last 12 Months465Last 6 weeks67- 1
Supplementary Materialpopl22main-p350-p-video.mp4
- Taolue Chen
- research-articleOpen AccessPublished By ACMPublished By ACM
CertiStr: a certified string solver
- Shuanglong Kan
TU Kaiserslautern, Germany
, - Anthony Widjaja Lin
TU Kaiserslautern, Germany / MPI-SWS, Germany
, - Philipp Rümmer
Uppsala University, Sweden
, - Micha Schrader
TU Kaiserslautern, Germany
CPP 2022: Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs•January 2022, pp 210-224• https://doi.org/10.1145/3497775.3503691Theories over strings are among the most heavily researched logical theories in the SMT community in the past decade, owing to the error-prone nature of string manipulations, which often leads to security vulnerabilities (e.g. cross-site scripting and ...
- 6Citation
- 486
- Downloads
MetricsTotal Citations6Total Downloads486Last 12 Months135Last 6 weeks14
- Shuanglong Kan
- research-article
A security type verifier for smart contracts
- Xinwen Hu
College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, No. 29 Jiangjun Rd., Nanjing, Jiangsu, 211106, China
, - Yi Zhuang
College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, No. 29 Jiangjun Rd., Nanjing, Jiangsu, 211106, China
, - Shang-Wei Lin
School of Computer Science and Engineering, Nanyang Technological University, 50 Nanyang Avenue, Singapore 639798, Singapore
, - Fuyuan Zhang
Group of Practical Formal Methods, Max Planck Institute for Software Systems, Paul-Ehrlich Strasse G26, Kaiserslautern, 67663, Germany
, - Shuanglong Kan
Department of Computer Science, TU Kaiserslautern, Geb. 34, Raum 421 Gottlieb-Daimler-Str, Kaiserslautern, 67663, Germany
, - Zining Cao
College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, No. 29 Jiangjun Rd., Nanjing, Jiangsu, 211106, China
Highlights- We introduce a formal calculus for Solidity, including syntax and semantics.
- We propose a Solidity Type Checker (STC) to prevent both explicit and implicit flows that violate integrity policies, whose soundness is proved w.r.t. non-...
Graphical abstractDisplay Omitted
AbstractThe widespread adoption of smart contracts demands strong security guarantees. Our work is motivated by the problem of statically checking potential information tampering in smart contracts. This paper presents a security type verification ...
- 4Citation
MetricsTotal Citations4
- Xinwen Hu
- research-articlePublished By ACMPublished By ACM
Detecting memory errors at runtime with source-level instrumentation
- Zhe Chen
Nanjing University of Aeronautics and Astronautics, China
, - Junqi Yan
Nanjing University of Aeronautics and Astronautics, China
, - Shuanglong Kan
Nanjing University of Aeronautics and Astronautics, China
, - Ju Qian
Nanjing University of Aeronautics and Astronautics, China
, - Jingling Xue
UNSW, Australia
ISSTA 2019: Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and Analysis•July 2019, pp 341-351• https://doi.org/10.1145/3293882.3330581The unsafe language features of C, such as low-level control of memory, often lead to memory errors, which can result in silent data corruption, security vulnerabilities, and program crashes. Dynamic analysis tools, which have been widely used for ...
- 17Citation
- 564
- Downloads
MetricsTotal Citations17Total Downloads564Last 12 Months40Last 6 weeks4
- Zhe Chen
- research-articlePublished By ACMPublished By ACM
A refinement-based compiler development for synchronous languages
- Jean-Paul Bodeveix
IRIT Université Paul Sabatier, Toulouse, France
, - Mamoun Filali-Amine
IRIT CNRS, Toulouse, France
, - Shuanglong Kan
Nanjing University of Aeronautics and Astronautics, Nanjing, China
MEMOCODE '17: Proceedings of the 15th ACM-IEEE International Conference on Formal Methods and Models for System Design•September 2017, pp 165-174• https://doi.org/10.1145/3127041.3127056In this paper, we are concerned by the elaboration of generic development steps for the code generation for synchronous languages. Our aim is to provide a correct by construction solution. For that purpose, we adopt a refinement-based approach where ...
- 1Citation
- 58
- Downloads
MetricsTotal Citations1Total Downloads58
- Jean-Paul Bodeveix
- research-articlePublished By ACMPublished By ACM
Traceability and model checking to support safety requirement verification
- Shuanglong Kan
Nanjing University of Aeronautics and Astronautics, China
FSE 2014: Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering•November 2014, pp 783-786• https://doi.org/10.1145/2635868.2666606Ensuring safety-critical software safety requires strict verification of the conformance between safety requirements and programs. Formal verification techniques, such as model checking and theorem proving, can be used to partially realize this ...
- 2Citation
- 302
- Downloads
MetricsTotal Citations2Total Downloads302Last 12 Months3
- Shuanglong Kan
Author Profile Pages
- Description: The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM bibliographic database, the Guide. Coverage of ACM publications is comprehensive from the 1950's. Coverage of other publishers generally starts in the mid 1980's. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community.
Please see the following 2007 Turing Award winners' profiles as examples: - History: Disambiguation of author names is of course required for precise identification of all the works, and only those works, by a unique individual. Of equal importance to ACM, author name normalization is also one critical prerequisite to building accurate citation and download statistics. For the past several years, ACM has worked to normalize author names, expand reference capture, and gather detailed usage statistics, all intended to provide the community with a robust set of publication metrics. The Author Profile Pages reveal the first result of these efforts.
- Normalization: ACM uses normalization algorithms to weigh several types of evidence for merging and splitting names.
These include:- co-authors: if we have two names and cannot disambiguate them based on name alone, then we see if they have a co-author in common. If so, this weighs towards the two names being the same person.
- affiliations: names in common with same affiliation weighs toward the two names being the same person.
- publication title: names in common whose works are published in same journal weighs toward the two names being the same person.
- keywords: names in common whose works address the same subject matter as determined from title and keywords, weigh toward being the same person.
The more conservative the merging algorithms, the more bits of evidence are required before a merge is made, resulting in greater precision but lower recall of works for a given Author Profile. Many bibliographic records have only author initials. Many names lack affiliations. With very common family names, typical in Asia, more liberal algorithms result in mistaken merges.
Automatic normalization of author names is not exact. Hence it is clear that manual intervention based on human knowledge is required to perfect algorithmic results. ACM is meeting this challenge, continuing to work to improve the automated merges by tweaking the weighting of the evidence in light of experience.
- Bibliometrics: In 1926, Alfred Lotka formulated his power law (known as Lotka's Law) describing the frequency of publication by authors in a given field. According to this bibliometric law of scientific productivity, only a very small percentage (~6%) of authors in a field will produce more than 10 articles while the majority (perhaps 60%) will have but a single article published. With ACM's first cut at author name normalization in place, the distribution of our authors with 1, 2, 3..n publications does not match Lotka's Law precisely, but neither is the distribution curve far off. For a definition of ACM's first set of publication statistics, see Bibliometrics
- Future Direction:
The initial release of the Author Edit Screen is open to anyone in the community with an ACM account, but it is limited to personal information. An author's photograph, a Home Page URL, and an email may be added, deleted or edited. Changes are reviewed before they are made available on the live site.
ACM will expand this edit facility to accommodate more types of data and facilitate ease of community participation with appropriate safeguards. In particular, authors or members of the community will be able to indicate works in their profile that do not belong there and merge others that do belong but are currently missing.
A direct search interface for Author Profiles will be built.
An institutional view of works emerging from their faculty and researchers will be provided along with a relevant set of metrics.
It is possible, too, that the Author Profile page may evolve to allow interested authors to upload unpublished professional materials to an area available for search and free educational use, but distinct from the ACM Digital Library proper. It is hard to predict what shape such an area for user-generated content may take, but it carries interesting potential for input from the community.
Bibliometrics
The ACM DL is a comprehensive repository of publications from the entire field of computing.
It is ACM's intention to make the derivation of any publication statistics it generates clear to the user.
- Average citations per article = The total Citation Count divided by the total Publication Count.
- Citation Count = cumulative total number of times all authored works by this author were cited by other works within ACM's bibliographic database. Almost all reference lists in articles published by ACM have been captured. References lists from other publishers are less well-represented in the database. Unresolved references are not included in the Citation Count. The Citation Count is citations TO any type of work, but the references counted are only FROM journal and proceedings articles. Reference lists from books, dissertations, and technical reports have not generally been captured in the database. (Citation Counts for individual works are displayed with the individual record listed on the Author Page.)
- Publication Count = all works of any genre within the universe of ACM's bibliographic database of computing literature of which this person was an author. Works where the person has role as editor, advisor, chair, etc. are listed on the page but are not part of the Publication Count.
- Publication Years = the span from the earliest year of publication on a work by this author to the most recent year of publication of a work by this author captured within the ACM bibliographic database of computing literature (The ACM Guide to Computing Literature, also known as "the Guide".
- Available for download = the total number of works by this author whose full texts may be downloaded from an ACM full-text article server. Downloads from external full-text sources linked to from within the ACM bibliographic space are not counted as 'available for download'.
- Average downloads per article = The total number of cumulative downloads divided by the number of articles (including multimedia objects) available for download from ACM's servers.
- Downloads (cumulative) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server since the downloads were first counted in May 2003. The counts displayed are updated monthly and are therefore 0-31 days behind the current date. Robotic activity is scrubbed from the download statistics.
- Downloads (12 months) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 12-month period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (12-month download counts for individual works are displayed with the individual record.)
- Downloads (6 weeks) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 6-week period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (6-week download counts for individual works are displayed with the individual record.)
ACM Author-Izer Service
Summary Description
ACM Author-Izer is a unique service that enables ACM authors to generate and post links on both their homepage and institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge.
Downloads from these sites are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to definitive version of ACM articles should reduce user confusion over article versioning.
ACM Author-Izer also extends ACM’s reputation as an innovative “Green Path” publisher, making ACM one of the first publishers of scholarly works to offer this model to its authors.
To access ACM Author-Izer, authors need to establish a free ACM web account. Should authors change institutions or sites, they can utilize the new ACM service to disable old links and re-authorize new links for free downloads from a different site.
How ACM Author-Izer Works
Authors may post ACM Author-Izer links in their own bibliographies maintained on their website and their own institution’s repository. The links take visitors to your page directly to the definitive version of individual articles inside the ACM Digital Library to download these articles for free.
The Service can be applied to all the articles you have ever published with ACM.
Depending on your previous activities within the ACM DL, you may need to take up to three steps to use ACM Author-Izer.
For authors who do not have a free ACM Web Account:
- Go to the ACM DL http://dl.acm.org/ and click SIGN UP. Once your account is established, proceed to next step.
For authors who have an ACM web account, but have not edited their ACM Author Profile page:
- Sign in to your ACM web account and go to your Author Profile page. Click "Add personal information" and add photograph, homepage address, etc. Click ADD AUTHOR INFORMATION to submit change. Once you receive email notification that your changes were accepted, you may utilize ACM Author-izer.
For authors who have an account and have already edited their Profile Page:
- Sign in to your ACM web account, go to your Author Profile page in the Digital Library, look for the ACM Author-izer link below each ACM published article, and begin the authorization process. If you have published many ACM articles, you may find a batch Authorization process useful. It is labeled: "Export as: ACM Author-Izer Service"
ACM Author-Izer also provides code snippets for authors to display download and citation statistics for each “authorized” article on their personal pages. Downloads from these pages are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of ACM articles should reduce user confusion over article versioning.
Note: You still retain the right to post your author-prepared preprint versions on your home pages and in your institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library. But any download of your preprint versions will not be counted in ACM usage statistics. If you use these AUTHOR-IZER links instead, usage by visitors to your page will be recorded in the ACM Digital Library and displayed on your page.
FAQ
- Q. What is ACM Author-Izer?
A. ACM Author-Izer is a unique, link-based, self-archiving service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles for free.
- Q. What articles are eligible for ACM Author-Izer?
- A. ACM Author-Izer can be applied to all the articles authors have ever published with ACM. It is also available to authors who will have articles published in ACM publications in the future.
- Q. Are there any restrictions on authors to use this service?
- A. No. An author does not need to subscribe to the ACM Digital Library nor even be a member of ACM.
- Q. What are the requirements to use this service?
- A. To access ACM Author-Izer, authors need to have a free ACM web account, must have an ACM Author Profile page in the Digital Library, and must take ownership of their Author Profile page.
- Q. What is an ACM Author Profile Page?
- A. The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM Digital Library. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community. Please visit the ACM Author Profile documentation page for more background information on these pages.
- Q. How do I find my Author Profile page and take ownership?
- A. You will need to take the following steps:
- Create a free ACM Web Account
- Sign-In to the ACM Digital Library
- Find your Author Profile Page by searching the ACM Digital Library for your name
- Find the result you authored (where your author name is a clickable link)
- Click on your name to go to the Author Profile Page
- Click the "Add Personal Information" link on the Author Profile Page
- Wait for ACM review and approval; generally less than 24 hours
- Q. Why does my photo not appear?
- A. Make sure that the image you submit is in .jpg or .gif format and that the file name does not contain special characters
- Q. What if I cannot find the Add Personal Information function on my author page?
- A. The ACM account linked to your profile page is different than the one you are logged into. Please logout and login to the account associated with your Author Profile Page.
- Q. What happens if an author changes the location of his bibliography or moves to a new institution?
- A. Should authors change institutions or sites, they can utilize ACM Author-Izer to disable old links and re-authorize new links for free downloads from a new location.
- Q. What happens if an author provides a URL that redirects to the author’s personal bibliography page?
- A. The service will not provide a free download from the ACM Digital Library. Instead the person who uses that link will simply go to the Citation Page for that article in the ACM Digital Library where the article may be accessed under the usual subscription rules.
However, if the author provides the target page URL, any link that redirects to that target page will enable a free download from the Service.
- Q. What happens if the author’s bibliography lives on a page with several aliases?
- A. Only one alias will work, whichever one is registered as the page containing the author’s bibliography. ACM has no technical solution to this problem at this time.
- Q. Why should authors use ACM Author-Izer?
- A. ACM Author-Izer lets visitors to authors’ personal home pages download articles for no charge from the ACM Digital Library. It allows authors to dynamically display real-time download and citation statistics for each “authorized” article on their personal site.
- Q. Does ACM Author-Izer provide benefits for authors?
- A. Downloads of definitive articles via Author-Izer links on the authors’ personal web page are captured in official ACM statistics to more accurately reflect usage and impact measurements.
Authors who do not use ACM Author-Izer links will not have downloads from their local, personal bibliographies counted. They do, however, retain the existing right to post author-prepared preprint versions on their home pages or institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library.
- Q. How does ACM Author-Izer benefit the computing community?
- A. ACM Author-Izer expands the visibility and dissemination of the definitive version of ACM articles. It is based on ACM’s strong belief that the computing community should have the widest possible access to the definitive versions of scholarly literature. By linking authors’ personal bibliography with the ACM Digital Library, user confusion over article versioning should be reduced over time.
In making ACM Author-Izer a free service to both authors and visitors to their websites, ACM is emphasizing its continuing commitment to the interests of its authors and to the computing community in ways that are consistent with its existing subscription-based access model.
- Q. Why can’t I find my most recent publication in my ACM Author Profile Page?
- A. There is a time delay between publication and the process which associates that publication with an Author Profile Page. Right now, that process usually takes 4-8 weeks.
- Q. How does ACM Author-Izer expand ACM’s “Green Path” Access Policies?
- A. ACM Author-Izer extends the rights and permissions that authors retain even after copyright transfer to ACM, which has been among the “greenest” publishers. ACM enables its author community to retain a wide range of rights related to copyright and reuse of materials. They include:
- Posting rights that ensure free access to their work outside the ACM Digital Library and print publications
- Rights to reuse any portion of their work in new works that they may create
- Copyright to artistic images in ACM’s graphics-oriented publications that authors may want to exploit in commercial contexts
- All patent rights, which remain with the original owner