Sciweavers

3663 search results - page 408 / 733
» Problems in the ontology of computer programs
Sort
View
HIPC
2007
Springer
15 years 10 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
ACSC
2004
IEEE
15 years 10 months ago
Exploiting FPGA Concurrency to Enhance JVM Performance
The Java Programming Language has been praised for its platform independence and portability, but because of its slow execution speed on a software Java Virtual Machine (JVM), som...
James Parnis, Gareth Lee
CC
2006
Springer
108views System Software» more  CC 2006»
15 years 10 months ago
Efficient Flow-Sensitive Interprocedural Data-Flow Analysis in the Presence of Pointers
This paper presents a new worklist algorithm that significantly speeds up a large class of flow-sensitive data-flow analyses, including typestate error checking and pointer analysi...
Teck Bok Tok, Samuel Z. Guyer, Calvin Lin
EMSOFT
2004
Springer
15 years 10 months ago
A methodology for generating verified combinatorial circuits
High-level programming languages offer significant expressivity but provide little or no guarantees about resource use. Resourcebounded languages -- such as hardware-description l...
Oleg Kiselyov, Kedar N. Swadi, Walid Taha
DCOSS
2006
Springer
15 years 10 months ago
Gappa: Gossip Based Multi-channel Reprogramming for Sensor Networks
Abstract. Reprogramming the sensor networks in place is an important and challenging problem. One way suggested for reprogramming is with the help of an UAV (Unmanned Ariel Vehicle...
Limin Wang, Sandeep S. Kulkarni