About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
SPLASH 2010
Workshop paper
Sal/Svm: An assembly language and virtual machine for computing with non-enumerated sets
Abstract
Presented is the design, implementation and evaluation of a system for computing with non-enumerative set representations. The implementation is in the form of a set assembly language (Sal) whose operations correspond to an implementation of the algebra of sets, with minimal added syntactic sugar; a compiler (Salc) for validation and static optimization of Sal definitions; and a virtual machine architecture (Svm) for executing Sal definitions. Sal/Svm has turned out to be a surprisingly versatile framework for a growing number of problems. One such application, as a framework for declaratively specifying computational problems with the same level of precision that traditional machine languages enable the specification of computational algorithms, is presented. Copyright © 2010 ACM.