Using program synthesis for program analysis
In this paper, we propose a unified framework for designing static analysers based on
program synthesis. For this purpose, we identify a fragment of second-order logic with …
program synthesis. For this purpose, we identify a fragment of second-order logic with …
[PDF][PDF] Second-order SAT solving using program synthesis
Program synthesis is the automated construction of software from a specification. While
program synthesis is undecidable in general, we show that synthesising finite-state …
program synthesis is undecidable in general, we show that synthesising finite-state …
Semantic refactorings
P Kesseli - 2017 - ora.ox.ac.uk
Refactorings are structured changes to existing software that leave its externally observable
behaviour unchanged. The intent is to improve readability, performance or other non …
behaviour unchanged. The intent is to improve readability, performance or other non …
Second-order propositional satisfiability
Fundamentally, every static program analyser searches for a proof through a combination of
heuristics providing candidate solutions and a candidate validation technique. Essentially …
heuristics providing candidate solutions and a candidate validation technique. Essentially …
[PDF][PDF] Program Analysis. In M. Davis, A. Fehnker, A. McIver, & A. Voronkov
In this paper, we propose a unified framework for designing static analysers based on
program synthesis. For this purpose, we identify a fragment of second-order logic with …
program synthesis. For this purpose, we identify a fragment of second-order logic with …