It is difficult for instructors of CS1 and CS2 courses to get accurate answers to such critical questions as "how long are students spending on programming assignments?"...
Christian Murphy, Gail E. Kaiser, Kristin Loveland...
The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskellstyle polytypic programs. In order to achieve this goal, we embed polytypic prog...
Abstract. Reasoning about social networks (labeled, directed, weighted graphs) is becoming increasingly important and there are now models of how certain phenomena (e.g. adoption o...
Paulo Shakarian, V. S. Subrahmanian, Maria Luisa S...
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
This paper shows how a recently introduced class of applications can be solved by constraint programming. This new type of application is due to the emergence of special real-time...