Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits

First Page		Document Content
Date: 2017-09-21 08:25:51 Software engineering Computer programming Computing Functional languages Data types Type theory Logic in computer science Automated theorem proving OCaml Coq Disjoint-set data structure Proof assistant		Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits Add to Reading List Source URL: chargueraud.org Download Document from Source Website File Size: 372,81 KB Share Document on Facebook

	Description Logics ILCS 2007 Introduction to Logic in Computer Science: Autumn 2007 DocID: 1xVOl - View Document
	Deontic Logic in Computer Science Leon van der Torre & Jörg Hansen ESSLIAugust 2008 DocID: 1uHka - View Document
	αKanren A Fresh Name in Nominal Logic Programming William E. Byrd and Daniel P. Friedman Department of Computer Science, Indiana University, Bloomington, IN 47408 {webyrd,dfried}@cs.indiana.edu DocID: 1ux8H - View Document
	23rd Annual IEEE Symposium on Logic in Computer Science Winning regions of higher-order pushdown games∗ A. Carayol† M. Hague‡ DocID: 1uwn4 - View Document
	Introduction to higher-order computation Nordic Logic School, Stockholm, 2017 Mart´ın H¨otzel Escard´o Theory Group, School of Computer Science University of Birmingham, UK DocID: 1ud4n - View Document