P. Abdulla, M. Atig, Y. Chen, L. Holík, A. Rezine, P. Rümmer & J. Stenman (2014):
String Constraints for Verification.
In: CAV'14,
doi:10.1007/978-3-319-08867-9_10.
R. Alur & P. Madhusudan (2004):
Visibly pushdown languages.
In: STOC'04,
doi:10.1145/1007352.1007390.
R. Amadini, A. Jordan, G. Gange, F. Gauthier, P. Schachte, H. Søndergaard, P. J. Stuckey & C. Zhang (2017):
Combining String Abstract Domains for JavaScript Analysis: An Evaluation.
In: TACAS'17,
doi:10.1007/978-3-662-54577-5_3.
V. Arceri & S. Maffeis (2017):
Abstract Domains for Type Juggling.
ENTCS 331,
doi:10.1016/j.entcs.2017.02.003.
G. Balakrishnan & T. Reps (2006):
Recency-Abstraction for Heap-Allocated Storage.
In: SAS'06,
doi:10.1007/11823230_15.
H. Bordihn, M. Holzer & M. Kutrib (2009):
Determination of finite automata accepting subregular languages.
Theor. Comput. Sci. 410(35),
doi:10.1016/j.tcs.2009.05.019.
A. Bouajjani, P. Habermehl, L. Holík, T. Touili & T. Vojnar (2008):
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata.
In: CIAA'08,
doi:10.1007/978-3-540-70844-5_7.
A. Bouajjani, P. Habermehl & T. Vojnar (2004):
Abstract Regular Model Checking.
In: CAV'04,
doi:10.1007/978-3-540-27813-9_29.
C. Câmpeanu, A. Paun & S. Yu (2002):
An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages.
Int. J. Found. Comput. Sci. 13(1),
doi:10.1142/S0129054102000960.
T. Choi, O. Lee, H. Kim & K. Doh (2006):
A Practical String Analyzer by the Widening Approach.
In: APLAS'06,
doi:10.1007/11924661_23.
Agostino Cortesi & Martina Olliaro (2018):
M-String Segmentation: A Refined Abstract Domain for String Analysis in C Programs.
In: TASE'18,
pp. 1–8,
doi:10.1109/TASE.2018.00009.
G. Costantini, P. Ferrara & A. Cortesi (2015):
A suite of abstract domains for static analysis of string values.
Softw., Pract. Exper. 45(2),
doi:10.1002/spe.2218.
P. Cousot (1997):
Types as Abstract Interpretations.
In: POPL'97,
doi:10.1145/263699.263744.
P. Cousot & R. Cousot (1977):
Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints.
In: POPL'77,
doi:10.1145/512950.512973.
P. Cousot & R. Cousot (1992):
Abstract Interpretation Frameworks.
J. Log. Comput. 2(4),
doi:10.1093/logcom/2.4.511.
P. Cousot & R. Cousot (1992):
Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation.
In: PLILP'92,
doi:10.1007/3-540-55844-6_142.
P. Cousot, R. Cousot & F. Logozzo (2011):
A parametric segmentation functor for fully automatic and scalable array content analysis.
In: POPL'11,
pp. 105–118,
doi:10.1145/1926385.1926399.
P. Cousot & N. Halbwachs (1978):
Automatic Discovery of Linear Restraints Among Variables of a Program.
In: POPL'78,
doi:10.1145/512760.512770.
M. D. Davis, R. Sigal & E. J. Weyuker (1994):
Computability, Complexity, and Languages: Fund. of Theor. CS.
Academic Press Professional, Inc.,
doi:10.2307/2275691.
M. Domaratzki, J. Shallit & S. Yu (2001):
Minimal Covers of Formal Languages.
In: DLT'01,
doi:10.1007/3-540-46011-X_28.
V. D'Silva (2006):
Widening for Automata.
Diploma Thesis, Institut Fur Informatick, UZH.
A. Fromherz, A. Ouadjaout & A. Miné (2018):
Static Value Analysis of Python Programs by Abstract Interpretation.
In: NFM'18,
doi:10.1007/978-3-319-77935-5_14.
R. Giacobazzi & I. Mastroeni (2016):
Making abstract models complete.
MSCS 26(4),
doi:10.1017/S0960129514000358.
R. Giacobazzi & E. Quintarelli (2001):
Incompleteness, counterexamples and refinements in abstract model-checking.
In: SAS'01,
doi:10.1007/3-540-47764-0_20.
R. Giacobazzi, F. Ranzato & F. Scozzari. (2000):
Making Abstract Interpretation Complete.
JACM 47(2),
doi:10.1145/333979.333989.
D. Hauzar & J. Kofron (2015):
Framework for Static Analysis of PHP Applications.
In: ECOOP'15,
doi:10.4230/LIPIcs.ECOOP.2015.689.
L. Holík, P. Janku, A. Lin, P. Rümmer & T. Vojnar (2018):
String constraints with concatenation and transducers solved efficiently,
doi:10.1145/3158092.
J. Hopcroft & J. Ullman (1979):
Introduction to Automata Theory, Languages and Computation.
Addison-Wesley,
doi:10.1145/568438.568455.
S. Jensen, A. Møller & P. Thiemann (2009):
Type Analysis for JavaScript.
In: SAS'09,
doi:10.1007/978-3-642-03237-0_17.
S. H. Jensen, P. A. Jonsson & A. Møller (2012):
Remedying the eval that men do.
In: ISSTA'12,
doi:10.1145/2338965.2336758.
V. Kashyap, K. Dewey, E. Kuefner, J. Wagner, K. Gibbons, J. Sarracino, B. Wiedermann & B. Hardekopf (2014):
JSAI: a static analysis platform for JavaScript.
In: FSE'14,
doi:10.1145/2635868.2635904.
H. Lee, S. Won, J. Jin, J. Cho & S. Ryu (2012):
SAFE: Formal specification and implementation of a scalable analysis framework for ECMAScript.
In: FOOL'12.
A. Widjaja Lin & P. Barceló (2016):
String solving with word equations and transducers: towards a logic for analysing mutation XSS.
In: POPL'16,
doi:10.1145/2837614.2837641.
J. Midtgaard, F. Nielson & H. R. Nielson (2016):
A Parametric Abstract Domain for Lattice-Valued Regular Expressions.
In: SAS'16,
doi:10.1007/978-3-662-53413-7_17.
C. Park, H. Im & S. Ryu (2016):
Precise and scalable static analysis of jQuery using a regular expression domain.
In: DLS'16,
doi:10.1145/2989225.2989228.
C. Park & S. Ryu (2015):
Scalable and Precise Static Analysis of JavaScript Applications via Loop-Sensitivity.
In: ECOOP'15,
doi:10.4230/LIPIcs.ECOOP.2015.735.
M. Pradel & K. Sen (2015):
The Good, the Bad, and the Ugly: An Empirical Study of Implicit Type Conversions in JavaScript.
In: ECOOP'15,
doi:10.4230/LIPIcs.ECOOP.2015.519.
E. Pribavkina & E. Rodaro (2010):
State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages.
In: DLT'10,
doi:10.1007/978-3-642-14455-4_34.
M Sharir & A Pnueli (1978):
Two approaches to interprocedural data flow analysis.
NYU CS,
NY.
W. Xu, F. Zhang & S. Zhu (2012):
The power of obfuscation techniques in malicious JavaScript code: A measurement study.
In: MALWARE'12,
doi:10.1109/MALWARE.2012.6461002.
F. Yu, T. Bultan, M. Cova & O. H. Ibarra (2008):
Symbolic String Verification: An Automata-Based Approach.
In: SPIN'08,
doi:10.1007/978-3-540-85114-1_21.
S. Yu, Q. Zhuang & K. Salomaa (1994):
The State Complexities of Some Basic Operations on Regular Languages.
Theor. Comput. Sci. 125(2),
doi:10.1016/0304-3975(92)00011-F.