Learn More
A method for register number estimation in unscheduled or partially scheduled dataflow graphs is presented. The strategy consists of studying the probability that an edge between two nodes crosses the boundary between two control steps, and its is based on a model that associates probabilities with the different scheduling alternatives of each node. These(More)
Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation. Abstract We provide a brief introduction to simulation methods and tools within Industrial Statistics. We illustrate both Monte Carlo and discrete event simulation,(More)
The well-founded semantics for normal logic programs is deened in a constructive way through the use of a xpoint operator and in general is not computable. We propose an approach for approximating through abstract interpretation the concrete behavior of normal logic programs described by the well-founded semantics. We provide also an abstract well-founded(More)
The paper introduces a semantics for logic programs based on rst order hereditary Harrop formulas which are expressed in terms of intuitionistic derivations. The derivations are constructed by means of an intuitionistic proof procedure that constitutes the resolution mechanism of the language. The semantics of a program is a goal independent denotation(More)