Sciweavers

365 search results - page 56 / 73
» Using Types as Approximations for Type Checking Prolog Progr...
Sort
View
SIGCSE
1992
ACM
178views Education» more  SIGCSE 1992»
13 years 11 months ago
A graphical computer simulator for systems programming courses
on through abstract instructions which approximate, but do not duplicate, the behavior of actual machines. Because they are designed for use in a variety of educational settings, C...
Mark Newsome, Cherri M. Pancake
SIGSOFT
2005
ACM
14 years 8 months ago
Lightweight object specification with typestates
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...
Kevin Bierhoff, Jonathan Aldrich
ML
2007
ACM
122views Machine Learning» more  ML 2007»
13 years 7 months ago
Status report: hot pickles, and how to serve them
The need for flexible forms of serialisation arises under many circumstances, e.g. for doing high-level inter-process communication or to achieve persistence. Many languages, inc...
Andreas Rossberg, Guido Tack, Leif Kornstaedt
ICML
2008
IEEE
14 years 8 months ago
Learning to classify with missing and corrupted features
After a classifier is trained using a machine learning algorithm and put to use in a real world system, it often faces noise which did not appear in the training data. Particularl...
Ofer Dekel, Ohad Shamir
PLDI
1999
ACM
13 years 12 months ago
Pointer Analysis for Multithreaded Programs
This paper presents a novel interprocedural, ow-sensitive, and context-sensitive pointer analysis algorithm for multithreaded programs that may concurrently update shared pointers...
Radu Rugina, Martin C. Rinard