Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJanuary 2014
Symbolic optimization with SMT solvers
POPL '14: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesPages 607–618https://doi.org/10.1145/2535838.2535857The rise in efficiency of Satisfiability Modulo Theories (SMT) solvers has created numerous uses for them in software verification, program synthesis, functional programming, refinement types, etc. In all of these applications, SMT solvers are used for ...
Also Published in:
ACM SIGPLAN Notices: Volume 49 Issue 1 - research-articleJanuary 2014
Abstract acceleration of general linear loops
POPL '14: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesPages 529–540https://doi.org/10.1145/2535838.2535843We present abstract acceleration techniques for computing loop invariants for numerical programs with linear assignments and conditionals. Whereas abstract interpretation techniques typically over-approximate the set of reachable states iteratively, ...
Also Published in:
ACM SIGPLAN Notices: Volume 49 Issue 1 - research-articleJanuary 2014
CakeML: a verified implementation of ML
POPL '14: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesPages 179–191https://doi.org/10.1145/2535838.2535841We have developed and mechanically verified an ML system called CakeML, which supports a substantial subset of Standard ML. CakeML is implemented as an interactive read-eval-print loop (REPL) in x86-64 machine code. Our correctness theorem ensures that ...
Also Published in:
ACM SIGPLAN Notices: Volume 49 Issue 1
