no code implementations • 24 Jun 2017 • Benjamin Cosman, Ranjit Jhala
We introduce the Fusion algorithm for local refinement type inference, yielding a new SMT-based method for verifying programs with polymorphic data types and higher-order functions.
Programming Languages
no code implementations • 24 Jun 2016 • Eric L Seidel, Ranjit Jhala, Westley Weimer
Our technique is able to generate witnesses for around 85% of the programs, our reduction graph yields small counterexamples for over 80% of the witnesses, and a simple heuristic allows us to use witnesses to locate the source of type errors with around 70% accuracy.
Programming Languages D.3.2; D.3.4; F.3.3
no code implementations • 1 Jul 2015 • Niki Vazou, Alexander Bakst, Ranjit Jhala
We present a notion of bounded quantification for refinement types and show how it expands the expressiveness of refinement typing by using it to develop typed combinators for: (1) relational algebra and safe database access, (2) Floyd-Hoare logic within a state transformer monad equipped with combinators for branching and looping, and (3) using the above to implement a refined IO monad that tracks capabilities and resource usage.
Programming Languages Software Engineering D.2.4; D.3.3; F.3.1
