Program specialization as a tool for solving word equations
From MaRDI portal
Publication:6646292
DOI10.4204/eptcs.341.4MaRDI QIDQ6646292
Publication date: 29 November 2024
Combinatorics on words (68R15) Theory of compilers and interpreters (68N20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15) Computational aspects of satisfiability (68R07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient SMT solver for string constraints
- Ping-pong protocols as prefix grammars: modelling and verification via program transformation
- Computational complexity via programming languages: Constant factors do matter
- Partial evaluation of computation process -- an approach to a compiler-compiler
- Efficient and flexible access control via Jones-optimal logic program specialisation
- On solving word equations using SAT
- An efficient algorithm for solving word equations
- Relational String Verification Using Multi-track Automata
- Recompression
- REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION
- Path Feasibility Analysis for String-Manipulating Programs
- The concept of a supercompiler
- A Transformation System for Developing Recursive Programs
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
- Solving Horn Clauses on Inductive Data Types Without Induction
- Progressive Reasoning over Recursively-Defined Strings
- Annotation of logic programs for independent AND-parallelism by partial evaluation
- Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis
- The hardness of solving simple word equations
- Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility
- A decision procedure for string logic with quadratic equations, regular expressions and length constraints
This page was built for publication: Program specialization as a tool for solving word equations
