We present a new method for automatically providing feedback for introductory programming problems. In order to use this method, we need a reference implementation of …
L Pulina, A Tacchella - … Conference, CAV 2010, Edinburgh, UK, July 15-19 …, 2010 - Springer
A key problem in the adoption of artificial neural networks in safety-related applications is that misbehaviors can be hardly ruled out with traditional analytical or probabilistic …
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier …
We present a new approach for learning programs from noisy datasets. Our approach is based on two new concepts: a regularized program generator which produces a candidate …
Fixing software bugs has always been an important and time-consuming process in software development. Fixing concurrency bugs has become especially critical in the multicore era …
G Jin, W Zhang, D Deng - … Symposium on Operating Systems Design and …, 2012 - usenix.org
Concurrency bugs are widespread in multithreaded programs. Fixing them is time- consuming and error-prone. We present CFix, a system that automates the repair of …
Graph-based games are an important tool in computer science. They have applications in synthesis, verification, refinement, and far beyond. We review graph-based games with …
X Wang, I Dillig, R Singh - Proceedings of the ACM on Programming …, 2017 - dl.acm.org
We present a new approach to example-guided program synthesis based on counterexample-guided abstraction refinement. Our method uses the abstract semantics of …
In recent years, Satisfiability Modulo Theory (SMT) solvers are becoming increasingly popular in the Computer Aided Verification and Reasoning community. Used natively or as …