Automated Grading of DFA Constructions Rajeev Alur and Loris D’Antoni Sumit Gulwani Dileep Kini and Mahesh Viswanathan Department of Computer Science Microsoft Research Department of Computer Science

First Page		Document Content
Date: 2013-05-16 00:14:15 Model theory Models of computation Formal languages Abstraction Metalogic Deterministic finite automaton Nondeterministic finite automaton Interpretation DFA minimization Automata theory Mathematics Logic		Automated Grading of DFA Constructions Rajeev Alur and Loris D’Antoni Sumit Gulwani Dileep Kini and Mahesh Viswanathan Department of Computer Science Microsoft Research Department of Computer Science Add to Reading List Source URL: research.microsoft.com Download Document from Source Website File Size: 789,37 KB Share Document on Facebook

	Overview Abstraction The Rest DocID: 1xW1V - View Document
	LMS-Verify Abstraction Without Regret for Verified Systems Programming Nada Amin & Tiark Rompf EPFL & Purdue University DocID: 1xVQq - View Document
	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