Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2510.11007

Help | Advanced Search

Computer Science > Programming Languages

arXiv:2510.11007 (cs)
[Submitted on 13 Oct 2025 ]

Title: Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)

Title: 摘要 用字方程定义的字符串域作为约简乘积(扩展版本)

Authors:Antonina Nepeivoda, Ilya Afanasyev
Abstract: We introduce a string-interval abstract domain, where string intervals are characterized by systems of word equations (encoding lower bounds on string values) and word disequalities (encoding upper bounds). Building upon the lattice structure of string intervals, we define an abstract string object as a reduced product on a string property semilattice, determined by length-non-increasing morphisms. We consider several reduction strategies for abstract string objects and show that upon these strategies the string object domain forms a lattice. We define basic abstract string operations on the domain, aiming to minimize computational overheads on the reduction, and show how the domain can be used to analyse properties of JavaScript string manipulating programs.
Abstract: 我们引入了一个字符串区间抽象域,其中字符串区间由单词方程系统(编码字符串值的下界)和单词不等式(编码字符串值的上界)来表征。 在字符串区间的格结构基础上,我们定义了一个抽象字符串对象,作为由长度非增同态确定的字符串属性半格上的约化乘积。 我们考虑了几种抽象字符串对象的约化策略,并证明在这些策略下,字符串对象域形成一个格。 我们在该域上定义了基本的抽象字符串操作,旨在最小化约化的计算开销,并展示了该域如何用于分析JavaScript字符串操作程序的性质。
Subjects: Programming Languages (cs.PL) ; Formal Languages and Automata Theory (cs.FL)
Cite as: arXiv:2510.11007 [cs.PL]
  (or arXiv:2510.11007v1 [cs.PL] for this version)
  https://doi.org/10.48550/arXiv.2510.11007
arXiv-issued DOI via DataCite

Submission history

From: Antonina Nepeivoda [view email]
[v1] Mon, 13 Oct 2025 04:55:40 UTC (61 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
cs.PL
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cs
cs.FL

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号