A powerful approach to finding errors in computer software is to translate a given program into a verification condition, a logical formula that is valid if and only if the program...
We propose a novel type inference algorithm for a dependentlytyped functional language. The novel features of our algorithm are: (i) it can iteratively refine dependent types wit...
ended abstract provides an overview of my research towards a dissertation thesis in the context of programming cognitive agents with non-monotonic reasoning capabilities. Categori...
Abstract. Termination analysis has received considerable attention, traditionally in the context of declarative programming, and recently also for imperative languages. In existing...
Elvira Albert, Puri Arenas, Michael Codish, Samir ...
Monte Carlo based SSTA serves as the golden standard against alternative SSTA algorithms, but it is seldom used in practice due to its high computation time. In this paper, we acc...
Jason Cong, Karthik Gururaj, Wei Jiang, Bin Liu, K...