How to Make Ad Hoc Proof Automation Less Ad Hoc

Gonthier, Georges; Ziliani, Beta; Nanevski, Aleksandar; Dreyer, Derek

doi:10.1145/2034773.2034798

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

How to Make Ad Hoc Proof Automation Less Ad Hoc

MPS-Authors

/persons/resource/persons146400

Ziliani, Beta
Group D. Dreyer, Max Planck Institute for Software Systems, Max Planck Society;

/persons/resource/persons144520

Dreyer, Derek
Group D. Dreyer, Max Planck Institute for Software Systems, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Gonthier, G., Ziliani, B., Nanevski, A., & Dreyer, D. (2011). How to Make Ad Hoc Proof Automation Less Ad Hoc. In ICFP’11: proceedings of the 2011 ACM SIGPLAN International Conference on Functional Programming (pp. 163-175). New York, NY: ACM.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0028-8B3B-3

Abstract

There is no abstract available