Relational Symbolic Execution

November 22, 2017 ยท Declared Dead ยท ๐Ÿ› ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Gian Pietro Farina, Stephen Chong, Marco Gaboardi arXiv ID 1711.08349 Category cs.PL: Programming Languages Citations 29 Venue ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming Last Checked 1 month ago
Abstract
Symbolic execution is a classical program analysis technique used to show that programs satisfy or violate given specifications. In this work we generalize symbolic execution to support program analysis for relational specifications in the form of relational properties - these are properties about two runs of two programs on related inputs, or about two executions of a single program on related inputs. Relational properties are useful to formalize notions in security and privacy, and to reason about program optimizations. We design a relational symbolic execution engine, named RelSym which supports interactive refutation, as well as proving of relational properties for programs written in a language with arrays and for-like loops.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Programming Languages

Died the same way โ€” ๐Ÿ‘ป Ghosted