Texas Tech Case Study.indd

First Page		Document Content
Date: 2013-08-27 11:26:24 Call-Em-All Email Technology Computing Association of Public and Land-Grant Universities Texas Texas Tech University		Texas Tech Case Study.indd Add to Reading List Source URL: cdn.call-em-all.com Download Document from Source Website File Size: 559,96 KB Share Document on Facebook

	Taking proof-based verified computation a few steps closer to practicality1 Srinath Setty, Victor Vu, Nikhil Panpalia, Benjamin Braun, Andrew J. Blumberg, and Michael Walfish The University of Texas at Austin Abstract. W DocID: 1xVQw - View Document
	Cost-Aware Automatic Program Repair Roopsha Samanta1? , Oswaldo Olivo2 , and E. Allen Emerson2 1 The University of Texas at Austin and IST Austria DocID: 1xVPw - View Document
	The Potential of Interference-Based Proof Systems Marijn J.H. Heule1 and Benjamin Kiesl2 1 2 Department of Computer Science, The University of Texas at Austin DocID: 1xVI3 - View Document
	Verifying computations with state Benjamin Braun, Ariel J. Feldman⋆ , Zuocheng Ren, Srinath Setty, Andrew J. Blumberg, and Michael Walfish The University of Texas at Austin ⋆ University of Pennsylvania Abstract When DocID: 1xVGQ - View Document
	A Case for Query-driven Predicate Answer Set Programming (Position Paper) Gopal Gupta Elmer Salazar, Kyle Marple, Zhuo Chen, Farhad Shakerin Department of Computer Science The University of Texas at Dallas DocID: 1xVE0 - View Document