We present a verification procedure for pure higher-order functional Scala programs with parametric types. We show that our procedure is sound for proofs, as well as sound and complete for counter-examples. The procedure reduces the analysis of higher-order programs to checking satisfiability of a sequence of quantifier-free formulas over theories such as algebraic data types, integer linear arithmetic, and unin-terpreted function symbols, thus enabling the use of efficient satisfiability modulo theory (SMT) solvers. Our solution supports arbitrary function types and arbi-trarily nested anonymous functions (which can be stored in data structures, passed as arguments, returned, and applied). Among the contributions of this work is supporting...
Procedures for first-order logic with equality are used in many modern theorem provers and solvers, ...
Abstract. A new framework for higher-order program verification has been recently proposed, in which...
We present an automated approach to relatively completely verifying safety (i.e., reachability) prop...
We present the foundations of a verifier for higher-order functional programs with generics and recu...
Abstract. We present a semi-decision procedure for checking satisfia-bility of formulas in the langu...
Type-based model checking algorithms for higher-order recursion schemes have recently emerged as a p...
Formal verification of real-world software systems remains challenging for a number of reasons, incl...
We present an automated approach to relatively completely veri-fying safety (i.e., reachability) pro...
We present the Leon verification system for a subset of the Scala programming language. Along with s...
We present a Bounded Model Checking technique for higher-order programs. The vehicle of our study is...
Abstract. We present Leon, a system for developing functional Scala programs annotated with contract...
Higher-order model checking (more precisely, the model check-ing of higher-order recursion schemes) ...
Abstract. The higher-dimensional modal µ-calculus is an extension of the µ-calculus that has been in...
We describe techniques for synthesis and verification of recursive functional programs over unbounde...
We propose an automated method for checking the validity of a formula of HFL(Z), a higher-order logi...
Procedures for first-order logic with equality are used in many modern theorem provers and solvers, ...
Abstract. A new framework for higher-order program verification has been recently proposed, in which...
We present an automated approach to relatively completely verifying safety (i.e., reachability) prop...
We present the foundations of a verifier for higher-order functional programs with generics and recu...
Abstract. We present a semi-decision procedure for checking satisfia-bility of formulas in the langu...
Type-based model checking algorithms for higher-order recursion schemes have recently emerged as a p...
Formal verification of real-world software systems remains challenging for a number of reasons, incl...
We present an automated approach to relatively completely veri-fying safety (i.e., reachability) pro...
We present the Leon verification system for a subset of the Scala programming language. Along with s...
We present a Bounded Model Checking technique for higher-order programs. The vehicle of our study is...
Abstract. We present Leon, a system for developing functional Scala programs annotated with contract...
Higher-order model checking (more precisely, the model check-ing of higher-order recursion schemes) ...
Abstract. The higher-dimensional modal µ-calculus is an extension of the µ-calculus that has been in...
We describe techniques for synthesis and verification of recursive functional programs over unbounde...
We propose an automated method for checking the validity of a formula of HFL(Z), a higher-order logi...
Procedures for first-order logic with equality are used in many modern theorem provers and solvers, ...
Abstract. A new framework for higher-order program verification has been recently proposed, in which...
We present an automated approach to relatively completely verifying safety (i.e., reachability) prop...