research-article

Verified programming in Guru

Authors:

Timothy SimpsonAuthors Info & Claims

PLPV '09: Proceedings of the 3rd workshop on Programming languages meets program verification

Pages 49 - 58

https://doi.org/10.1145/1481848.1481856

Published: 20 January 2009 Publication History

Abstract

Operational Type Theory (OpTT) is a type theory allowing possibly diverging programs while retaining decidability of type checking and a consistent logic. This is done by distinguishing proofs and (program) terms, as well as formulas and types. The theory features propositional equality on type-free terms, which facilitates reasoning about dependently typed programs. OpTT has been implemented in the Guru verified programming language, which includes a type- and proof-checker, and a compiler to efficient C code. In addition to the core OpTT, Guru implements a number of extensions, including ones for verification of programs using mutable state and input/output. This paper gives an introduction to verified programming in Guru.

References

[1]

A. Appel. Foundational Proof-Carrying Code. In 16th Annual IEEE Symposium on Logic in Computer Science, 2001.

Digital Library

[2]

E. Barendsen and S. Smetsers. Conventional and Uniqueness Typing in Graph Rewrite Systems. In Proc. 13th Conference on Foundations of Software Technology and Theoretical Computer Science, pages 41--51. Springer-Verlag, 1993.

Digital Library

[3]

C. Barrett and C. Tinelli. CVC3. In W. Damm and H. Hermanns, editors, Proceedings of the 19th International Conference on Computer Aided Verification (CAV '07), pages 298--302. Springer-Verlag, 2007.

Digital Library

[4]

C. Chen and H. Xi. Combining Programming with Theorem Proving. In Proceedings of the 10th International Conference on Functional Programming (ICFP05), Tallinn, Estonia, September 2005.

Digital Library

[5]

R. Harper, F. Honsell, and G. Plotkin. A Framework for Defining Logics. Journal of the Association for Computing Machinery, 40 (1): 143--184, January 1993.

Digital Library

[6]

Matthew Hertz and Emery D. Berger. Quantifying the Performance of Garbage Collection vs. Explicit Memory Management. In Proc. 20th Annual ACM SIGPLAN Conference on Object Oriented Programming, Systems, Languages, and Applications, pages 313--326. ACM, 2005.

Digital Library

[7]

M. Hofmann and T. Streicher. The groupoid interpretation of type theory. In G. Sambin, editor, Twenty-five years of constructive type theory, pages 83--111. Oxford: Clarendon Press, 1998.

[8]

D. Lee, K. Crary, and R. Harper. Towards a Mechanized Metatheory of Standard ML. In Proc. 34th ACM Symposium on Principles of Programming Languages, pages 173--184. ACM Press, 2007.

Digital Library

[9]

D. Licata and R. Harper. A Formulation of Dependent ML with Explicit Equality Proofs. Technical Report CMU-CS-05-178, Carnegie Mellon University School of Computer Science, December 2005.

[10]

C. McBride and J. McKinna. The View from the Left. Journal of Functional Programming, 14 (1), 2004.

Digital Library

[11]

M. Moskal. Rocket-Fast Proof Checking for SMT Solvers. In C. Ramakrishnan and J. Rehof, editors, Tools and Algorithms for the Construction and Analysis of Systems, 2008.

Digital Library

[12]

A. Nanevski and G. Morrisett. Dependent Type Theory of Stateful Higher-Order Functions. Technical Report TR-24-05, Harvard University, 2005.

[13]

G. Necula. Proof-Carrying Code. In 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 106--119, January 1997.

Digital Library

[14]

U. Norell. Towards a Practical Programming Language Based on Dependent Type Theory. PhD thesis, Chalmers University of Technology, 2007.

[15]

E Pasalic, J. Siek, W. Taha, and S. Fogarty. Concoqtion: Indexed Types Now! In G. Ramalingam and E. Visser, editors, ACM SIGPLAN 2007 Workshop on Partial Evaluation and Program Manipulation, 2007.

Digital Library

[16]

A. Petcher. Deciding Joinability Modulo Ground Equations in Operational Type Theory. Master's thesis, Washington University in Saint Louis, May 2008. Available from http://cl.cse.wustl.edu.

[17]

F. Pfenning and C. Schürmann. System Description: Twelf -- A Meta-Logical Framework for Deductive Systems. In 16th International Conference on Automated Deduction, 1999.

Digital Library

[18]

Benjamin C. Pierce and David N. Turner. Local type inference. In 25TH ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 252--265, 1998.

Digital Library

[19]

T. Sheard. Type-Level Computation Using Narrowing in Ωmega. In Programming Languages meets Program Verification, 2006.

Digital Library

[20]

A. Stump. Proof Checking Technology for Satisfiability Modulo Theories. In A. Abel and C. Urban, editors, Logical Frameworks and Meta-Languages: Theory and Practice, 2008.

[21]

A. Stump and D. Oe. Towards an SMT Proof Format. In C. Barrett and L. de Moura, editors, International Workshop on Satisfiability Modulo Theories, 2008.

Digital Library

[22]

A. Stump and E. Westbrook. A Core Operational Type Theory. Under review, available from http://www.cs.uiowa.edu/ astump.

[23]

W. Swierstra and T. Altenkirch. Beauty in the Beast. In Haskell Workshop, 2007.

Digital Library

[24]

The Coq Development Team. The Coq Proof Assistant Reference Manual, Version V8.0, 2004. http://coq.inria.fr.

[25]

C. Urban, J. Cheney, and S. Berghofer. Mechanising the Metatheory of LF. In Proc. of the 23rd IEEE Symposium on Logic in Computer Science, pages 45--56. IEEE Computer Society, 2008.

Digital Library

[26]

K. Watkins, I. Cervesato, F. Pfenning, and D. Walker. A Concurrent Logical Framework I: Judgments and Properties. Technical Report CMU-CS-02-101, Carnegie Mellon University, 2002.

[27]

M. Zeller, A. Stump, and M. Deters. Signature Compilation for the Edinburgh Logical Framework. In C. Schürmann, editor, Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP), 2007.

[28]

D. Zhu and H. Xi. Safe Programming with Pointers through Stateful Views. In Proceedings of the 7th International Symposium on Practical Aspects of Declarative Languages, pages 83--97, Long Beach, CA, January 2005. Springer-Verlag LNCS vol. 3350.

Digital Library

Cited By

YANG YOLIVEIRA B(2019)Pure iso-type systemsJournal of Functional Programming10.1017/S095679681900010829Online publication date: 17-Sep-2019
https://doi.org/10.1017/S0956796819000108
Fleury M(2019)Optimizing a Verified SAT SolverNASA Formal Methods10.1007/978-3-030-20652-9_10(148-165)Online publication date: 28-May-2019
https://doi.org/10.1007/978-3-030-20652-9_10
Fleury MBlanchette JLammich PAndronick JFelty A(2018)A verified SAT solver with watched literals using imperative HOLProceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs10.1145/3167080(158-171)Online publication date: 8-Jan-2018
https://dl.acm.org/doi/10.1145/3167080
Show More Cited By

Index Terms

Verified programming in Guru
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Functional languages
2. Theory of computation
  1. Semantics and reasoning
    1. Program reasoning
      1. Program verification

Recommendations

Dependently typed programming with singletons
Haskell '12: Proceedings of the 2012 Haskell Symposium

Haskell programmers have been experimenting with dependent types for at least a decade, using clever encodings that push the limits of the Haskell type system. However, the cleverness of these encodings is also their main drawback. Although the ideas ...
Dependently typed programming with singletons
Haskell '12

Haskell programmers have been experimenting with dependent types for at least a decade, using clever encodings that push the limits of the Haskell type system. However, the cleverness of these encodings is also their main drawback. Although the ideas ...
Resource typing in Guru
PLPV '10: Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification

This paper presents a resource typing framework for the Guru verified-programming language, in which abstractions for various kinds of program resources can be defined. Implemented examples include reference-counted data, mutable arrays, and heap-...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PLPV '09: Proceedings of the 3rd workshop on Programming languages meets program verification

January 2009

90 pages

ISBN:9781605583303

DOI:10.1145/1481848

Program Chairs:
Thorsten Altenkirch
University of Nottingham, UK
,
Todd Millstein
University of California, Los Angeles, USA

Copyright © 2009 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 January 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

POPL09

Sponsor:

POPL09: The 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

January 20, 2009

GA, Savannah, USA

Acceptance Rates

Overall Acceptance Rate 18 of 25 submissions, 72%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

36
Total Citations
View Citations
187
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

YANG YOLIVEIRA B(2019)Pure iso-type systemsJournal of Functional Programming10.1017/S095679681900010829Online publication date: 17-Sep-2019
https://doi.org/10.1017/S0956796819000108
Fleury M(2019)Optimizing a Verified SAT SolverNASA Formal Methods10.1007/978-3-030-20652-9_10(148-165)Online publication date: 28-May-2019
https://doi.org/10.1007/978-3-030-20652-9_10
Fleury MBlanchette JLammich PAndronick JFelty A(2018)A verified SAT solver with watched literals using imperative HOLProceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs10.1145/3167080(158-171)Online publication date: 8-Jan-2018
https://dl.acm.org/doi/10.1145/3167080
Yang YOliveira B(2017)Unifying typing and subtypingProceedings of the ACM on Programming Languages10.1145/31338711:OOPSLA(1-26)Online publication date: 12-Oct-2017
https://dl.acm.org/doi/10.1145/3133871
Yang YBi XOliveira B(2016)Unified Syntax with Iso-typesProgramming Languages and Systems10.1007/978-3-319-47958-3_14(251-270)Online publication date: 9-Oct-2016
https://doi.org/10.1007/978-3-319-47958-3_14
Chan YCorrea CMa K(2014)Regression CubeACM Transactions on Interactive Intelligent Systems10.1145/25903494:1(1-32)Online publication date: 1-Apr-2014
https://dl.acm.org/doi/10.1145/2590349
Callaway CStock ODekoven E(2014)Experiments with Mobile Drama in an Instrumented Museum for Inducing Conversation in Small GroupsACM Transactions on Interactive Intelligent Systems10.1145/25842504:1(1-39)Online publication date: 1-Apr-2014
https://dl.acm.org/doi/10.1145/2584250
Nurmi PSalovaara AForsblom ABohnert FFloréen P(2014)PromotionRankACM Transactions on Interactive Intelligent Systems10.1145/25842494:1(1-23)Online publication date: 1-Apr-2014
https://dl.acm.org/doi/10.1145/2584249
Casinghino CSjöberg VWeirich S(2014)Combining proofs and programs in a dependently typed languageACM SIGPLAN Notices10.1145/2578855.253588349:1(33-45)Online publication date: 8-Jan-2014
https://dl.acm.org/doi/10.1145/2578855.2535883
Clochard MMarché CPaskevich ADanielsson NJacobs B(2014)Verified programs with bindersProceedings of the ACM SIGPLAN 2014 Workshop on Programming Languages meets Program Verification10.1145/2541568.2541571(29-40)Online publication date: 11-Jan-2014
https://dl.acm.org/doi/10.1145/2541568.2541571
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents