This composite string and in- teger analysis enables us to verify properties that cannot be verified using string analysis or size analysis alone. 1 ...

We present an automata-based approach for symbolic verification of systems with unbounded string and integer variables. Particularly, we are interested in ...

A string automaton is a single-track DFA that accepts a regular language, whose length forms a semi-linear set, .e.g.,. {4,6}∪{2+3k | k ≥ 0}.

A static analysis technique that uses these automata in a forward fixpoint computation with widening and is able to catch relationships among the lengths of ...

Sciweavers · Symbolic String Verification: Combining String Analysis and Size Analysis.

We present an automata-based approach for the verification of string operations in PHP programs based on symbolic string analysis.

Ibarra, 2009.03, 'Symbolic String Verification: Combining String Analysis and Size Analysis, ' the 15th International Conference on Tools and Algorithms for ...

String analysis is a static analysis technique that determines the values that a string expression can take during program execution at a given program point.

We present an automata-based approach for the verification of string operations in PHP programs based on symbolic string analysis. String analysis is a ...

The symbol + represents, as usual, string concatenation, while ; is used to separate different sons of a node. For the first program, the resulting string graph ...