International Static Analysis Symposium, SAS 2014


Title/Authors Title Research Artifacts
[?] A research artifact is any by-product of a research project that is not directly included in the published research paper. In Computer Science research this is often source code and data sets, but it could also be media, documentation, inputs to proof assistants, shell-scripts to run experiments, etc.
Details

Cost-Aware Automatic Program Repair

Roopsha Samanta, Oswaldo Olivo, E. Allen Emerson

Cost-Aware Automatic Program Repair

Details
Discussion Comments: 0
Verification: Authors have not verified information

An Abstract Domain Combinator for Separately Conjoining Memory Abstractions

Antoine Toubhans, Bor-Yuh Evan Chang, Xavier Rival

An Abstract Domain Combinator for Separately Conjoining Memory Abstractions

Details
Discussion Comments: 0
Verification: Authors have not verified information

A Decision Tree Abstract Domain for Proving Conditional Termination

Caterina Urban, Antoine Miné

A Decision Tree Abstract Domain for Proving Conditional Termination

Details
Discussion Comments: 0
Verification: Authors have not verified information

An Abstract Domain to Infer Octagonal Constraints with Absolute Value

Liqian Chen, Jiangchao Liu, Antoine Miné, Deepak Kapur, Ji Wang

An Abstract Domain to Infer Octagonal Constraints with Absolute Value

Details
Discussion Comments: 0
Verification: Authors have not verified information

Peak Cost Analysis of Distributed Systems

Elvira Albert, Jesús Correas Fernández, Guillermo Román-Díez

Peak Cost Analysis of Distributed Systems

Details
Discussion Comments: 0
Verification: Authors have not verified information

Region-Based Selective Flow-Sensitive Pointer Analysis

Sen Ye, Yulei Sui, Jingling Xue

Region-Based Selective Flow-Sensitive Pointer Analysis

Details
Discussion Comments: 0
Verification: Authors have not verified information

Backward Analysis via over-Approximate Abstraction and under-Approximate Subtraction

Alexey Bakhirkin, Josh Berdine, Nir Piterman

Backward Analysis via over-Approximate Abstraction and under-Approximate Subtraction

Details
Discussion Comments: 0
Verification: Authors have not verified information

Cyclic Abduction of Inductively Defined Safety and Termination Preconditions

James Brotherston, Nikos Gorogiannis

Cyclic Abduction of Inductively Defined Safety and Termination Preconditions

Details
Discussion Comments: 0
Verification: Authors have not verified information

Synthesis of Memory Fences via Refinement Propagation

Yuri Meshman, Andrei Marian Dan, Martin T. Vechev, Eran Yahav

Synthesis of Memory Fences via Refinement Propagation

Details
Discussion Comments: 0
Verification: Authors have not verified information

Reactivity of Cooperative Systems - Application to ReactiveML

Louis Mandel, Cédric Pasteur

Reactivity of Cooperative Systems - Application to ReactiveML

Details
Discussion Comments: 0
Verification: Authors have not verified information

SawjaCard: A Static Analysis Tool for Certifying Java Card Applications

Frédéric Besson, Thomas P. Jensen, Pierre Vittet

SawjaCard: A Static Analysis Tool for Certifying Java Card Applications

Details
Discussion Comments: 0
Verification: Authors have not verified information

Invariance of Conjunctions of Polynomial Equalities for Algebraic Differential Equations

Khalil Ghorbal, Andrew Sogokon, André Platzer

Invariance of Conjunctions of Polynomial Equalities for Algebraic Differential Equations

Details
Discussion Comments: 0
Verification: Authors have not verified information

Sparse Dataflow Analysis with Pointers and Reachability

Magnus Madsen, Anders Møller

Sparse Dataflow Analysis with Pointers and Reachability

Details
Discussion Comments: 0
Verification: Authors have not verified information

Speeding Up Logico-Numerical Strategy Iteration

David Monniaux, Peter Schrammel

Speeding Up Logico-Numerical Strategy Iteration

Details
Discussion Comments: 0
Verification: Authors have not verified information

A Progress Bar for Static Analyzers

Woosuk Lee, Hakjoo Oh, Kwangkeun Yi

A Progress Bar for Static Analyzers

Details
Discussion Comments: 0
Verification: Authors have not verified information

Expectation Invariants for Probabilistic Program Loops as Fixed Points

Aleksandar Chakarov, Sriram Sankaranarayanan

Expectation Invariants for Probabilistic Program Loops as Fixed Points

Details
Discussion Comments: 0
Verification: Authors have not verified information

On Program Equivalence with Reductions

Guillaume Iooss, Christophe Alias, Sanjay V. Rajopadhye

On Program Equivalence with Reductions

Details
Author Comments:
Discussion Comments: 0
Sharing: Research produced artifacts
Verification: Authors have verified information

Block Me If You Can! - Context-Sensitive Parameterized Verification

Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík

Block Me If You Can! - Context-Sensitive Parameterized Verification

Details
Discussion Comments: 0
Verification: Authors have not verified information

Verifying Recursive Programs Using Intraprocedural Analyzers

Yu-Fang Chen, Chiao Hsieh, Ming-Hsien Tsai, Bow-Yaw Wang, Farn Wang

Verifying Recursive Programs Using Intraprocedural Analyzers

Details
Discussion Comments: 0
Verification: Authors have not verified information

Automatic Analysis of Open Objects in Dynamic Language Programs

Arlen Cox, Bor-Yuh Evan Chang, Xavier Rival

Automatic Analysis of Open Objects in Dynamic Language Programs

Details
Discussion Comments: 0
Verification: Authors have not verified information