Partial Orders for Efficient Bounded Model Checking of Concurrent Software? Jade Alglave1 , Daniel Kroening2 , and Michael Tautschnig3 1 3

First Page		Document Content
Computing Computer memory Memory barrier Static single assignment form Symbolic execution Computer engineering		Partial Orders for Efficient Bounded Model Checking of Concurrent Software? Jade Alglave1 , Daniel Kroening2 , and Michael Tautschnig3 1 3 Add to Reading List Source URL: www0.cs.ucl.ac.uk Download Document from Source Website File Size: 366,65 KB Share Document on Facebook

	arXiv:1708.09114v1 [cs.CR] 30 AugFirmUSB: Vetting USB Device Firmware using Domain Informed Symbolic Execution Grant Hernandez∗ DocID: 1xVC4 - View Document
	Poster: Dynamic Taint Analysis of Concurrent Program Based on Symbolic Execution Yu Hao∗ , Xiaodong Zhang∗ , Zijiang Yang† and Ting Liu∗ ,IEEEauthorrefmark2 ∗ Ministry of Education Key Lab for Intelligent Netw DocID: 1xVzE - View Document
	Multi-Solver Support in Symbolic Execution Hristina Palikareva, Cristian Cadar SMT Workshop 2014, Vienna, 17 July 2014 Dynamic Symbolic Execution DocID: 1xV4A - View Document
	Symbolic Execution for a Clash-Free Subset of ASMs ? Gerhard Schellhorna , Gidon Ernsta , J¨org Pf¨ahlera , Stefan Bodenm¨ ullera , a Wolfgang Reif a Institute DocID: 1xU5v - View Document
	Symbolic execution for BIOS security1 Oleksandr Bazhaniuk, John Loucaides, Lee Rosenbaum, Mark R. Tuttle, Vincent Zimmer2 Intel Corporation May 25, 2015 Abstract We are building a tool that uses symbolic execution to DocID: 1viNk - View Document