Liquid types

Rondon, Patrick M.; Kawaguci, Ming; Jhala, Ranjit

doi:10.1145/1379022.1375602

Cited by 133 publications

(214 citation statements)

References 19 publications

Supporting

Mentioning

213

Contrasting

Order By: Relevance

“…Hence, for example, if a list of prime numbers is passed in, the result is prime, and if a list of even numbers is passed in, the result is even. Thus, we can use refinement types [22] Here the % represents the modulus operator in the refinement logic [6] and we type the primitive mod :: x:Int -> y:Int -> {v: Int | v = x % y}. Verification proceeds as follows.…”

Section: Parametric Invariantsmentioning

confidence: 99%

“…Several groups have shown how refinement types can be used to verify properties ranging from partial correctness concerns like array bounds checking [26,22] and data structure invariants [16] to the correctness of security protocols [2], web applications [14] and implementations of cryptographic protocols [10].…”

Section: Introductionmentioning

confidence: 99%

“…-Second, we demonstrate that type checking remains decidable ( §3), as SMT solvers can efficiently discharge logical subsumption queries over abstract refinements using decision procedures based on congruence closure [19] -Third, we show that the crucial problem of inferring appropriate instantiations for the (abstract) refinement parameters boils down to inferring (non-abstract) refinement types ( §3), which we have previously addressed via the abstract interpretation framework of Liquid Types [22]. -Finally, we have implemented abstract refinements in HSOLVE, a new Liquid Typebased verifier for Haskell.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Abstract Refinement Types

Vazou

Rondon

Jhala

2013

Programming Languages and Systems

Self Cite

121

View full text Add to dashboard Cite

Abstract. We present abstract refinement types which enable quantification over the refinements of data-and function-types. Our key insight is that we can avail of quantification while preserving SMT-based decidability, simply by encoding refinement parameters as uninterpreted propositions within the ground refinement logic. We illustrate how this simple mechanism yields a variety of sophisticated and automatic means for reasoning about programs, including: parametric refinements for reasoning with type classes, index-dependent refinements for reasoning about key-value maps, recursive refinements for reasoning about data structures, and inductive refinements for reasoning about higher-order traversal routines. We have implemented our approach in HSOLVE, a refinement type checker for Haskell, and present experiments using HSOLVE to verify correctness invariants of various programs.

show abstract

Section: Parametric Invariantsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Abstract Refinement Types

Vazou

Rondon

Jhala

2013

Programming Languages and Systems

Self Cite

121

View full text Add to dashboard Cite

show abstract

“…We believe that the focus on counterexamples will make our approach very appealing to programmers that are not theorem proving experts. The HMC verifier [17] and DSolve [26] can automatically discover inductive invariants, so they have more automation, but it appears that certain properties involving multiple user-defined functions are not expressible in these systems. Recent results also demonstrate inference techniques for higherorder functional programs [19,17].…”

Section: Related Workmentioning

confidence: 99%

Satisfiability Modulo Recursive Programs

2011

View full text Add to dashboard Cite

Abstract. We present a semi-decision procedure for checking satisfiability of expressive correctness properties of recursive first-order functional programs. In our approach, both properties and programs are expressed in the same language, a subset of Scala. We implemented our procedure and integrated it with the Z3 SMT solver and the Scala compiler. Our procedure is sound for counterexamples and for proofs of terminating functions. It is terminating and thus complete for many important classes of specifications, including all satisfiable formulas and all formulas where recursive functions satisfy certain syntactic restrictions. Using our system, Leon, we verified detailed correctness properties for functional data structure implementations, as well as syntax tree manipulations. We have found our system to be fast for both finding counterexamples and finding correctness proofs, and to scale to larger programs than alternative techniques.

show abstract

“…Meanwhile, we can utilise such works as our pure solver, for example the disjunction inference [10]. Semi-automatic approaches [37,38] are also used to infer numerical constraints for given type templates in functional programs, where data structures are mostly immutable.…”

Section: Related Workmentioning

confidence: 99%

Automatically refining partial specifications for heap-manipulating programs

Qin

Luo

et al. 2014

Science of Computer Programming

View full text Add to dashboard Cite

Automatically verifying heap-manipulating programs is a challenging task, especially when dealing with complex data structures with strong invariants, such as sorted lists and AVL/red-black trees. The verification process can greatly benefit from human assistance through specification annotations, but this process requires intellectual effort from users and is error-prone. In this paper, we propose a new approach to program verification that allows users to provide only partial specification to methods. Our approach will then refine the given annotation into a more complete specification by discovering missing constraints. The discovered constraints may involve both numerical and multi-set properties that could be later confirmed or revised by users. We further augment our approach by requiring partial specification to be given only for primary methods. Specifications for loops and auxiliary methods can then be systematically discovered by our augmented mechanism, with the help of information propagated from the primary methods. Our work is aimed at verifying beyond shape properties, with the eventual goal of analysing full functional properties for pointer-based data structures. Initial experiments have confirmed that we can automatically refine partial specifications with non-trivial constraints, thus making it easier for users to handle specifications with richer properties.

show abstract

Liquid types

Cited by 133 publications

References 19 publications

Abstract Refinement Types

Abstract Refinement Types

Satisfiability Modulo Recursive Programs

Automatically refining partial specifications for heap-manipulating programs

Contact Info

Product

Resources

About