Sciweavers

9503 search results - page 195 / 1901
» Authenticated System Calls
Sort
View
184
Voted
RTA
2004
Springer
16 years 14 days ago
A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems
Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent type...
Frédéric Blanqui
149
Voted
IPPS
1999
IEEE
15 years 11 months ago
PARADIGM (version 2.0): A New HPF Compilation System
In this paper,a we present sample performance figures for a new linear algebra-based compilation framework implemented in a research HPF compiler called PARADIGM. The metrics cons...
Pramod G. Joisha, Prithviraj Banerjee
188
Voted
FLAIRS
2008
15 years 9 months ago
Declarative Specification and Interpretation of Rule-Based Systems
A declarative rule inference engine can be very useful for modern distributed or heterogeneous applications, if it can be configured for multiple semantics and evaluation strategi...
Dietmar Seipel, Joachim Baumeister
ICDCS
2003
IEEE
16 years 12 days ago
Monitoring and Characterization of Component-Based Systems with Global Causality Capture
Current software development techniques and tools lack the capability to characterize function call chains in multithreaded and distributed applications built upon component techn...
Jun Li
PDPTA
2004
15 years 8 months ago
Telepresent Agents: A New Paradigm for Networked Systems
Telepresent Agents are software Agents that are instantiated simultaneously within two or more distinct computer applications (called Locales) which are operating at distinct nodes...
Russ Abbott, Behzad Parviz, Chengyu Sun