Towards more efficient methods for solving regular-expression heavy string constraints (Q2680985): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Path Feasibility Analysis for String-Manipulating Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The satisfiability of word equations: decidable and undecidable theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata-based model counting for string constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: String solving with word equations and transducers: towards a logic for analysing mutation XSS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: String theories involving regular membership predicates: from practice to theory and back / rank
 
Normal rank
Property / cites work
 
Property / cites work: An SMT solver for regular expressions and linear arithmetic over string length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata and unary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chrobak Normal Form Revisited, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427903 / rank
 
Normal rank

Latest revision as of 05:31, 31 July 2024

scientific article
Language Label Description Also known as
English
Towards more efficient methods for solving regular-expression heavy string constraints
scientific article

    Statements

    Towards more efficient methods for solving regular-expression heavy string constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 January 2023
    0 references
    SMT solving
    0 references
    string solving
    0 references
    string constraints
    0 references
    regular expressions
    0 references
    linear length constraints
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers