Demand-Driven Context-Sensitive Alias Analysis for Java Dacong Yan Guoqing Xu Atanas Rountev

First Page		Document Content
Date: 2017-06-27 01:04:15 Graph theory Graph connectivity Strongly connected component Reachability Graph Node Topological sorting		Demand-Driven Context-Sensitive Alias Analysis for Java Dacong Yan Guoqing Xu Atanas Rountev Add to Reading List Source URL: dacongy.github.io Download Document from Source Website File Size: 417,38 KB Share Document on Facebook

	Reachability in Recursive Markov Decision Processes? Tom´ aˇs Br´ azdil, V´ aclav Broˇzek, Vojtˇech Forejt, and Anton´ın Kuˇcera DocID: 1xW2m - View Document
	Reachability Analysis of Deep Neural Networks with Provable Guarantees Wenjie Ruan1 , Xiaowei Huang2 , Marta Kwiatkowska1 Department of Computer Science, University of Oxford, UK 2 Department of Computer Science, Univers DocID: 1xW0E - View Document
	Towards Personalized Cancer Therapy Using Delta-Reachability Analysis∗ Bing Liu Soonho Kong DocID: 1xVOI - View Document
	Symbolic Optimal Expected Time Reachability Computation and Controller Synthesis for Probabilistic Timed Automata Aleksandra Jovanovi´ca , Marta Kwiatkowskaa , Gethin Normanb , Quentin Peyrasc a Department DocID: 1xVlv - View Document
	LIPIcs Leibniz International Proceedings in Informatics Continuous-Time Stochastic Games with Time-Bounded Reachability DocID: 1xVbZ - View Document