Tool Artifact for ``Imperative Program Synthesis from Assertions by Abstract Static Analysis and SMT Mutations''

In this work, we describe the installation, usage, and evaluation results of the tool, denoted IMPSynth, introduced by the paper``Imperative Program Synthesis from Assertions by Abstract Static Analysis and SMT Mutations''. We provide step-by-step instructions on how to download, run, and compare the tool's outputs to outputs described in the paper. The tool is a research prototype tool for synthesizing imperative programs that meet behavioral specifications given in the form of assertions. In particular, we combine basic statement-directed enumerative search, static analysis via abstraction interpretation, and expression-directed enumerative search via (incremental) SMT-based mutations to efficiently explore all candidate complete programs generated from an input program template (with statement and expression holes) until a solution is found.

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2024-10-13
DOI
https://doi.org/10.5281/zenodo.13926448
Primary Topic
Logic, programming, and type systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Tool Artifact for ``Imperative Program Synthesis from Assertions by Abstract Static Analysis and SMT Mutations''

Zenodo (CERN European Organization for Nuclear Research)
Logic, programming, and type systems
article

Tool Artifact for ``Imperative Program Synthesis from Assertions by Abstract Static Analysis and SMT Mutations''

article en

Abstract

In this work, we describe the installation, usage, and evaluation results of the tool, denoted IMPSynth, introduced by the paper``Imperative Program Synthesis from Assertions by Abstract Static Analysis and SMT Mutations''. We provide step-by-step instructions on how to download, run, and compare the tool's outputs to outputs described in the paper. The tool is a research prototype tool for synthesizing imperative programs that meet behavioral specifications given in the form of assertions. In particular, we combine basic statement-directed enumerative search, static analysis via abstraction interpretation, and expression-directed enumerative search via (incremental) SMT-based mutations to efficiently explore all candidate complete programs generated from an input program template (with statement and expression holes) until a solution is found.

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 61%
Logic, programming, and type systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.