Quantitative program sketching using lifted static analysis

DOI10.1007/978-3-030-99429-7_6MaRDI QIDQ6535551zbMATH OpenFDO

Authors Aleksandar Dimovski

Publication date 23 January 2024

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-99429-7_6

zbMATH Keywords

abstract interpretationquantitative program sketchingsoftware product lines

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Solving program sketches with large integer values
• Bridging Boolean and quantitative synthesis using smoothed proof search
• Optimizing synthesis with metasketches
• Syntax-guided synthesis with quantitative syntactic objectives

Cites work

• A decision tree lifted domain for analyzing program families with numerical features
• A scalable segmented decision tree abstract domain
• Better Quality in Synthesis through Quantitative Objectives
• Bridging Boolean and quantitative synthesis using smoothed proof search
• Finding suitable variability abstractions for lifted analysis
• scientific article; zbMATH DE number 1324833 (Why is no real title available?)
• Measuring and synthesizing systems in probabilistic environments

This page was built for publication: Quantitative program sketching using lifted static analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535551)