JFP 27, e19, 29 pages, 2017 https://doi.orgS0956796817000107 1

Source URL: jeapostrophe.github.io

• Mathematics
• Mathematical logic
• Theoretical computer science
• Enumerative combinatorics
• Enumeration
• Ordering
• Lambda calculus
• Type theory
• Enumerated type
• Recursively enumerable set
• Combinatory logic

Synthesizing Ranking Functions from Bits and Pieces? Caterina Urban1,2 , Arie Gurfinkel2 , and Temesghen Kahsai2,3 1 ETH Z¨

Source URL: seahorn.github.io

• Mathematics
• Infinite loop
• Recursion
• Function
• Computability theory
• Computing

Effective Abstractions for Verification under Relaxed Memory Models Andrei Dan1 , Yuri Meshman2 , Martin Vechev1 , and Eran Yahav2 1 ETH Zurich

Source URL: practicalsynthesis.github.io

• Computer memory
• Computing
• Circular buffer
• Abstract interpretation
• Thread
• Data buffer
• Futures and promises

A Context-Sensitive Memory Model for Verification of C/C++ Programs Arie Gurfinkel and Jorge A. Navas University of Waterloo and SRI International SAS’17, August 30th, 2017

Source URL: seahorn.github.io

• C
• Data types
• Software engineering
• Computing
• Computer programming
• Pointer
• Compatibility of C and C++
• Const
• Typedef

Bolt: Anonymous Payment Channelsfor Decentralized Currencies

Source URL: acmccs.github.io

• Cryptocurrencies
• Economy
• Alternative currencies
• Money
• Finance
• E-commerce
• Bitcoin
• Blockchains
• Lightning Network
• IDEAL
• Digital currency
• Payment

Learning + Synthesis Armando Solar-Lezama ML as Synthesis ML

Source URL: uclmr.github.io

SMT-Based Model Checking for Recursive Programs ⋆ Anvesh Komuravelli, Arie Gurfinkel, and Sagar Chaki Carnegie Mellon University, Pittsburgh, PA, USA Abstract. We present an SMT-based symbolic model checking algorithm

Source URL: seahorn.github.io

• Mathematics
• Symbol
• 120-cell
• Craig interpolation
• Computability theory
• Fiber bundles
• Differential topology

Extending SMTCoq, a Certified Checker for SMT (Extended Abstract) Burak Ekici Guy Katz

Source URL: mebsout.github.io

• Theoretical computer science
• Mathematical logic
• Mathematics
• Formal methods
• Logic in computer science
• Electronic design automation
• NP-complete problems
• Proof assistants
• Satisfiability modulo theories
• Automated theorem proving
• Coq
• Propositional calculus

Practical Semantic Test Simplification Sai Zhang University of Washington, USA Abstract—We present a technique that simplifies tests at the

Source URL: zhang-sai.github.io

• Software testing
• Software development
• Software engineering
• Computing
• Debugging
• Program slicing
• Unit testing
• Test automation

D REAM C ODER: Bootstrapping Domain-Specific Languages for Neurally-Guided Bayesian Program Learning Kevin Ellis 1 Lucas Morales 1 Mathias Sabl´e Meyer 1 Armando Solar-Lezama 1 Joshua B. TenenbaumIntroduction

Source URL: uclmr.github.io

• Computational neuroscience
• Software engineering
• Applied mathematics
• Computing
• Domain-specific language
• Artificial neural network
• Neural network
• Algorithm
• Fold
• Generative model
• Convolutional neural network