Sciweavers

4716 search results - page 657 / 944
» Iterative-free program analysis
Sort
View
PLDI
1994
ACM
15 years 10 months ago
Memory Access Coalescing: A technique for Eliminating Redundant memory Accesses
As microprocessor speeds increase, memory bandwidth is increasing y the performance bottleneck for microprocessors. This has occurred because innovation and technological improvem...
Jack W. Davidson, Sanjay Jinturkar
DBPL
1989
Springer
165views Database» more  DBPL 1989»
15 years 10 months ago
Support for Data-Intensive Applications: Conceptual Design and Software Development
In the process of developing an Information System, one passes through stages that include requirements gathering, design specification, and software implementation. The purpose ...
Alexander Borgida, John Mylopoulos, Joachim W. Sch...
FPCA
1989
15 years 10 months ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori
FPCA
1989
15 years 10 months ago
Theorems for Free!
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Philip Wadler
EMSOFT
2007
Springer
15 years 10 months ago
Verification of device drivers and intelligent controllers: a case study
The soundness of device drivers generally cannot be verified in isolation, but has to take into account the reactions of the hardware devices. In critical embedded systems, interf...
David Monniaux