Sciweavers

166 search results - page 13 / 34
» Type-Dependence Analysis and Program Transformation for Symb...
Sort
View
ENTCS
2006
153views more  ENTCS 2006»
13 years 7 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu
TACAS
2009
Springer
136views Algorithms» more  TACAS 2009»
14 years 2 months ago
Path Feasibility Analysis for String-Manipulating Programs
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
Nikolaj Bjørner, Nikolai Tillmann, Andrei V...
TACAS
2010
Springer
245views Algorithms» more  TACAS 2010»
14 years 2 months ago
Stranger: An Automata-Based String Analysis Tool for PHP
STRANGER is an automata-based string analysis tool for finding and eliminating string-related security vulnerabilities in PHP applications. STRANGER uses symbolic forward and back...
Fang Yu, Muath Alkhalaf, Tevfik Bultan
CCS
2009
ACM
14 years 2 months ago
Privacy-preserving genomic computation through program specialization
In this paper, we present a new approach to performing important classes of genomic computations (e.g., search for homologous genes) that makes a significant step towards privacy...
Rui Wang, XiaoFeng Wang, Zhou Li, Haixu Tang, Mich...
POPL
2009
ACM
14 years 8 months ago
Automatic modular abstractions for linear constraints
c Modular Abstractions for Linear Constraints David Monniaux VERIMAG June 27, 2008 se a method for automatically generating abstract transformers for static by abstract interpreta...
David Monniaux