scientific article; zbMATH DE number 2090837
From MaRDI portal
Publication:4813388
zbMath1067.68541MaRDI QIDQ4813388
Anders Møller, Aske Simon Christensen, Michael I. Schwartzbach
Publication date: 13 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2694/26940001.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (24)
Enforcing Programming Guidelines with Region Types and Effects ⋮ Relaxed Parsing of Regular Approximations of String-Embedded Languages ⋮ Efficient static checker for tainted variable attacks ⋮ Preventing injection attacks with syntax embeddings ⋮ Simple and safe SQL queries with \texttt{C++} templates ⋮ Word equations in synergy with regular constraints ⋮ A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings ⋮ Simple linear string constraints ⋮ Twinning automata and regular expressions for string static analysis ⋮ Static Detection of DoS Vulnerabilities in Programs that Use Regular Expressions ⋮ An efficient SMT solver for string constraints ⋮ Automata-based symbolic string analysis for vulnerability detection ⋮ Z3str2: an efficient solver for strings, regular expressions, and length constraints ⋮ A type and effect system for activation flow of components in Android programs ⋮ XML graphs in program analysis ⋮ Analyzing ambiguity of context-free grammars ⋮ Verifying pointer and string analyses with region type systems ⋮ Trading Plaintext-Awareness for Simulatability to Achieve Chosen Ciphertext Security ⋮ Path Feasibility Analysis for String-Manipulating Programs ⋮ Symbolic String Verification: Combining String Analysis and Size Analysis ⋮ Relational String Verification Using Multi-track Automata ⋮ An Evaluation of Automata Algorithms for String Analysis ⋮ String Analysis as an Abstract Interpretation ⋮ Completeness of string analysis for dynamic languages
This page was built for publication: