Sciweavers

6960 search results - page 89 / 1392
» Continuity Analysis of Programs
Sort
View
128
Voted
ESOP
2008
Springer
15 years 4 months ago
A Hybrid Denotational Semantics for Hybrid Systems
Abstract. In this article, we present a model and a denotational semantics for hybrid systems. Our model is designed to be used for the verification of large, existing embedded app...
Olivier Bouissou, Matthieu Martel
ICLP
1999
Springer
15 years 7 months ago
Binding-time Analysis for Mercury
In this work, we develop a binding-time analysis for the logic programming language Mercury. We introduce a precise domain of binding-times, based on the type information available...
Wim Vanhoof, Maurice Bruynooghe
SIGSOFT
2005
ACM
16 years 3 months ago
Towards a unified formal model for supporting mechanisms of dynamic component update
The continuous requirements of evolving a delivered software system and the rising cost of shutting down a running software system are forcing researchers and practitioners to fin...
Junrong Shen, Xi Sun, Gang Huang, Wenpin Jiao, Yan...
IEEEPACT
2006
IEEE
15 years 9 months ago
Whole-program optimization of global variable layout
On machines with high-performance processors, the memory system continues to be a performance bottleneck. Compilers insert prefetch operations and reorder data accesses to improve...
Nathaniel McIntosh, Sandya Mannarswamy, Robert Hun...
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
15 years 8 months ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee