Theorem Proving using Lazy Proof Expli ation Corma Flanagan1 , Rajeev Joshi1 , Xinming Ou2 , and James B. Saxe1 1 Systems Resear h Center, HP Labs, Palo Alto, CA 2

First Page		Document Content
Date: 2010-09-11 18:26:03 Theoretical computer science Logic Formal methods Mathematical logic Model theory Interpretation Logic in computer science Propositional calculus Boolean satisfiability problem Automated theorem proving Propositional variable IP		Theorem Proving using Lazy Proof Expli ation Corma Flanagan1 , Rajeev Joshi1 , Xinming Ou2 , and James B. Saxe1 1 Systems Resear h Center, HP Labs, Palo Alto, CA 2 Add to Reading List Source URL: rjoshi.org Download Document from Source Website File Size: 192,07 KB Share Document on Facebook

	IKOS: A Framework for Static Analysis based on Abstract Interpretation (Tool Paper) Guillaume Brat, Jorge A. Navas, Nija Shi, and Arnaud Venet NASA Ames Research Center, Moffett Field, CAAbstract. The RTCA standar DocID: 1xVJ1 - View Document
	Zero Returns to Compulsory Schooling in Germany: Evidence and Interpretation Jörn-Ste¤en Pischke LSE Till von Wachter DocID: 1xVdg - View Document
	Zero Returns to Compulsory Schooling in Germany: Evidence and Interpretation Jörn-Ste¤en Pischke LSE Till von Wachter DocID: 1xV7j - View Document
	THE EXT ALGEBRA OF A QUANTIZED CYCLE DAMIEN CALAQUE AND JULIEN GRIVAUX Abstract. Given a quantized analytic cycle (X, σ) in Y, we give a categorical Lie-theoretic interpretation of a geometric condition, discovered by S DocID: 1xV3t - View Document
	Tutorial to Locales and Locale Interpretation∗ Clemens Ballarin Abstract Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover DocID: 1xV3j - View Document