Sciweavers

2736 search results - page 200 / 548
» Implementable allocation rules
Sort
View
ULPAA
1994
152views Hardware» more  ULPAA 1994»
15 years 7 months ago
Programming with ASN.1 Using Polymorphic Types and Type Specialization
object-oriented abstractions is described that permits direct programming with ASN.1 speci ed types. The design and implementation also supports the exible use of di erent encoding...
R. Greg Lavender, Dennis G. Kafura, R. W. Mullins
122
Voted
CORR
2006
Springer
106views Education» more  CORR 2006»
15 years 6 months ago
Checkbochs: Use Hardware to Check Software
In this paper, we present a system called Checkbochs, a machine simulator that checks rules about its guest operating system and applications at the hardware level. The properties...
Sorav Bansal
ENTCS
2000
123views more  ENTCS 2000»
15 years 6 months ago
Defining Standard Prolog in Rewriting Logic
The coincidence between the model-theoretic and the procedural semantics of SLDresolution does not carry over to a Prolog system that also implements non-logical features like cut...
Marija Kulas, Christoph Beierle
ENTCS
2007
87views more  ENTCS 2007»
15 years 6 months ago
A Study on the Practicality of Poly-Controlled Partial Evaluation
Poly-controlled partial evaluation (PCPE) is a flexible approach for specializing logic programs, which has been recently proposed. It takes into account repertoires of global co...
Claudio Ochoa, Germán Puebla
PLDI
2012
ACM
13 years 8 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...