Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
Recursion synthesis with unrealizability witnesses
PLDI 2022: Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and ImplementationPages 244–259https://doi.org/10.1145/3519939.3523726We propose SE2GIS, a novel inductive recursion synthesis approach with the ability to both synthesize code and declare a problem unsolvable. SE2GIS combines a symbolic variant of counterexample-guided inductive synthesis (CEGIS) with a new dual ...
ANOSY: approximated knowledge synthesis with refinement types for declassification
PLDI 2022: Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and ImplementationPages 15–30https://doi.org/10.1145/3519939.3523725Non-interference is a popular way to enforce confidentiality of sensitive data. However, declassification of sensitive information is often needed in realistic applications but breaks non-interference. We present ANOSY, an approximate knowledge ...
Leapfrog: certified equivalence for protocol parsers
PLDI 2022: Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and ImplementationPages 950–965https://doi.org/10.1145/3519939.3523715We present Leapfrog, a Coq-based framework for verifying equivalence of network protocol parsers. Our approach is based on an automata model of P4 parsers, and an algorithm for symbolically computing a compact representation of a bisimulation, using "...
Relational compilation for performance-critical applications: extensible proof-producing translation of functional models into low-level code
PLDI 2022: Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and ImplementationPages 918–933https://doi.org/10.1145/3519939.3523706There are typically two ways to compile and run a purely functional program verified using an interactive theorem prover (ITP): automatically extracting it to a similar language (typically an unverified process, like Coq to OCaml) or manually proving it ...
Differential cost analysis with simultaneous potentials and anti-potentials
PLDI 2022: Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and ImplementationPages 442–457https://doi.org/10.1145/3519939.3523435We present a novel approach to differential cost analysis that, given a program revision, attempts to statically bound the difference in resource usage, or cost, between the two program versions. Differential cost analysis is particularly interesting ...