An efficient SMT solver for string constraints (Q518402): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(14 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Pex / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: StarExec / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Stranger / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PASS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: HAMPI / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: z3 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: JST / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Z3-str / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: S3 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVC4 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Kaluza / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10703-016-0247-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2330747214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplification by Cooperating Decision Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting on Demand in SAT Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Feasibility Analysis for String-Manipulating Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving SAT and SAT Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4813388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evaluation of Automata Algorithms for String Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardware and software: verification and testing. 9th international Haifa verification conference, HVC 2013, Haifa, Israel, November 5--7, 2013. Proceedings / 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: Q4146913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability of word equations with constants is in PSPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of Symbolic Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic Automata Constraint Solving / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 13:57, 13 July 2024

scientific article
Language Label Description Also known as
English
An efficient SMT solver for string constraints
scientific article

    Statements

    An efficient SMT solver for string constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 March 2017
    0 references
    string solving
    0 references
    satisfiability modulo theories
    0 references
    automated deduction
    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