A decision procedure for string to code point conversion
From MaRDI portal
Publication:2096448
Recommendations
- A Decision Procedure for Path Feasibility of String Manipulating Programs with Integer Data Type
- An algorithm for source coding subject to a fidelity criterion, based on string matching
- On converting character strings to integers
- Static analysis of string encoders and decoders
- An algorithm for matching run-length coded strings
- Coding Strings by Pairs of Strings
- scientific article; zbMATH DE number 3861050
- Conversion of a modular number system code into a generalized position code
- A complete mechanization of correctness of a string-preprocessing algorithm
Cites work
- A mathematical introduction to logic.
- Chain-free string constraints
- Computer aided verification. 26th international conference, CAV 2014, held as part of the Vienna summer of logic, VSL 2014, Vienna, Austria, July 18--22, 2014. Proceedings
- Concatenation as a basis for arithmetic
- Definability in the Existential Theory of Concatenation and Undecidable Extensions of this Theory
- scientific article; zbMATH DE number 3577484 (Why is no real title available?)
- Path Feasibility Analysis for String-Manipulating Programs
- Qex: symbolic SQL query explorer
- Scaling up DPLL(T) string solvers using context-dependent simplification
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- Splitting on Demand in SAT Modulo Theories
- String solving with word equations and transducers: towards a logic for analysing mutation XSS
This page was built for publication: A decision procedure for string to code point conversion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096448)
