Alloy Modeling Language meets SMT-LIB Forrest Cinelli, Kyle McCormick, Dan Dougherty WPI NSF Supportand

First Page		Document Content
Date: 2018-06-13 06:07:43 Mathematical logic Theoretical computer science Formal methods Constraint programming Alloy Massachusetts Institute of Technology Z notation Predicate logic SMT Predicate Constraint satisfaction problem Satisfiability modulo theories		Alloy Modeling Language meets SMT-LIB Forrest Cinelli, Kyle McCormick, Dan Dougherty WPI NSF Supportand Add to Reading List Source URL: alloytools.org Download Document from Source Website File Size: 254,85 KB Share Document on Facebook

	SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri1 , Robert Nieuwenhuis2 , and Albert Oliveras2 1 DocID: 1xVJt - View Document
	Predicate Abstraction for Relaxed Memory Models Andrei Dan1 , Yuri Meshman2 , Martin Vechev1 , and Eran Yahav2 1 ETH Zurich {andrei.dan, martin.vechev}@inf.ethz.ch DocID: 1xVFk - 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
	Predicate Abstraction for Programmable Logic Controllers Sebastian Biallas, Mirco Giacobbe and Stefan Kowalewski Embedded Software Laboratory, RWTH Aachen University, Germany Abstract. In this paper, we present a predic DocID: 1xUQe - View Document
	SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri? , Robert Nieuwenhuis?? , and Albert Oliveras?? Abstract. Predicate abstraction is a technique for automatically extracting finite-state abstractions for s DocID: 1xUHn - View Document