We present a strictly bottom-up, summary-based, and precise heap analysis targeted for program verification that performs strong updates to heap locations at call sites. We firs...
Isil Dillig, Thomas Dillig, Alex Aiken, Mooly Sagi...
We propose a general formal model of isolated hierarchical parallel computations, and identify several fragments to match the concurrency constructs present in real-world programm...
This paper gives an overview of the error sources in the solution of DAEs and discusses how different algorithms use tolerances to control these errors. The tolerance models of th...
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
Daniel S. Dantas, David Walker, Geoffrey Washburn,...
This paper presents an adaptation of Luc Steels’s model of Category Formation and Language Sharing. The simple competitive learning algorithm is proposed as a more general means ...