Serviceeinschränkungen vom 12.-22.02.2026 - weitere Infos auf der UB-Homepage

Treffer: Precise analysis of string expressions

Title:
Precise analysis of string expressions
Authors:
CHRISTENSEN, Aske Simon, MØLLER, Anders, SCHWARTZBACH, Michael I
Source:
SAS 2003 : state analysis (San Diego CA, 11-13 June 2003)Lecture notes in computer science. :1-18
Publisher Information:
Berlin: Springer, 2003.
Publication Year:
2003
Physical Description:
print, 18 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Généralités, General, Analyse programme, Program analysis, Análisis programa, Chaîne caractère, Character string, Cadena carácter, Expression régulière, Regular expression, Expresión regular, Flot donnée, Data flow, Flujo datos, Flot graphe, Graph flow, Flujo grafo, Grammaire CF, Context free grammar, Gramática independiente, Graphe fluence, Fluence graph, Grafo fluencia, Graphe flux, Flow graphs, Interrogation base donnée, Database query, Interrogación base datos, Langage JAVA, JAVA language, Lenguaje JAVA, Langage rationnel, Regular language, Lenguaje racional, Reconnaissance parole, Speech recognition, Reconocimiento voz, SQL, Vérification programme, Program verification, Verificación programa, Analyse statique, Static analysis, Análisis estática, Langage régulier, Lenguaje regular
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
BRICS, Department of Computer Science, University of Aarhus, Denmark
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=15851396
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15851396
Database:
PASCAL Archive

Weitere Informationen

We perform static analysis of Java programs to answer a simple question: which values may occur as results of string expressions? The answers are summarized for each expression by a regular language that is guaranteed to contain all possible values. We present several applications of this analysis, including statically checking the syntax of dynamically generated expressions, such as SQL queries. Our analysis constructs flow graphs from class files and generates a context-free grammar with a nonterminal for each string expression. The language of this grammar is then widened into a regular language through a variant of an algorithm previously used for speech recognition. The collection of resulting regular languages is compactly represented as a special kind of multi-level automaton from which individual answers may be extracted. If a program error is detected, examples of invalid strings are automatically produced. We present extensive benchmarks demonstrating that the analysis is efficient and produces results of useful precision.