Verified programming in Guru

Authors:
Aaron Stump;Morgan Deters;Adam Petcher;Todd Schiller;Timothy Simpson
Affiliations:
The University of Iowa, Iowa City, IA, USA;Technical University of Catalonia, Barcelona, Spain;Washington University in St. Louis, St. Louis, MO, USA;Washington University in St. Louis, St. Louis, MO, USA;Washington University in St. Louis, St. Louis, MO, USA
Venue:
Proceedings of the 3rd workshop on Programming languages meets program verification
Year:
2009

Citing 17
Cited 13

A framework for defining logics

Journal of the ACM (JACM)
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Local type inference

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Conventional and Uniqueness Typing in Graph Rewrite Systems

Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Foundational Proof-Carrying Code

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
The view from the left

Journal of Functional Programming
Combining programming with theorem proving

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Quantifying the performance of garbage collection vs. explicit memory management

OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Towards a mechanized metatheory of standard ML

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Concoqtion: indexed types now!

Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Type-level Computation Using Narrowing in Ωmega

Electronic Notes in Theoretical Computer Science (ENTCS)
Beauty in the beast

Haskell '07 Proceedings of the ACM SIGPLAN workshop on Haskell workshop
Mechanizing the Metatheory of LF

LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Towards an SMT proof format

SMT '08/BPR '08 Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning
CVC3

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Rocket-fast proof checking for SMT solvers

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Safe programming with pointers through stateful views

PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages

Dependent types and program equivalence

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Operating system development with ATS: work in progress

Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification
Resource typing in Guru

Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification
Type-preserving compilation of end-to-end verification of security enforcement

PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
Self-certification: bootstrapping certified typecheckers in F* with Coq

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dependent interoperability

PLPV '12 Proceedings of the sixth workshop on Programming languages meets program verification
Equational reasoning about programs with general recursion and call-by-value semantics

PLPV '12 Proceedings of the sixth workshop on Programming languages meets program verification
Enforcing stateful authorization and information flow policies in fine

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
versat: a verified modern SAT solver

VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
System FC with explicit kind equality

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Automating theorem proving with SMT

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Combining proofs and programs in a dependently typed language

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Verified programs with binders

Proceedings of the ACM SIGPLAN 2014 Workshop on Programming Languages meets Program Verification

Quantified Score

Hi-index	0.00

Visualization

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.