Scrambling and Descrambling SMT-LIB Benchmarks Tjark Weber Uppsala University, Sweden

First Page		Document Content
Date: 2016-07-01 09:29:03 Computer programming Declarative programming Theoretical computer science Logic in computer science Cryptography Satellite broadcasting Scrambler Telecommunications equipment Satisfiability modulo theories Scrambling Monad Benchmark		Scrambling and Descrambling SMT-LIB Benchmarks Tjark Weber Uppsala University, Sweden Add to Reading List Source URL: user.it.uu.se Download Document from Source Website File Size: 342,40 KB Share Document on Facebook

	Functional Programming for Compiling and Decompiling Computer-Aided Design DocID: 1xW3j - View Document
	Programming with “Big Code”: Lessons, Techniques and Applications Pavol Bielik1 , Veselin Raychev1 , and Martin Vechev1 1 Department of Computer Science, ETH Zurich, Switzerland DocID: 1xVVx - 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
	Science of Computer Programming, 14(2-3), 1990, ppAlgorithm Theories and Design Tactics Douglas R. Smith and Michael R. Lowry Kestrel Institute 3260 Hillview Avenue DocID: 1xVuR - View Document
	A Breadth-First Course in Multicore and Manycore Programming Suzanne Rivoire Sonoma State University Department of Computer Science DocID: 1xTRO - View Document