Sciweavers

655 search results - page 62 / 131
» On Flat Programs with Lists
Sort
View
ASAP
2008
IEEE
120views Hardware» more  ASAP 2008»
13 years 9 months ago
Lightweight DMA management mechanisms for multiprocessors on FPGA
This paper presents a multiprocessor system on FPGA that adopts Direct Memory Access (DMA) mechanisms to move data between the external memory and the local memory of each process...
Antonino Tumeo, Matteo Monchiero, Gianluca Palermo...
IJFCS
2006
119views more  IJFCS 2006»
13 years 7 months ago
Enforcing Concurrent Temporal Behaviors
The outcome of verifying software is often a `counterexample', i.e., a listing of the actions and states of a behavior not satisfying the specification. In order to understan...
Doron Peled, Hongyang Qu
ITA
2007
153views Communications» more  ITA 2007»
13 years 7 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...
NFM
2011
252views Formal Methods» more  NFM 2011»
13 years 2 months ago
Call Invariants
Program verifiers based on first-order theorem provers model the program heap as a collection of mutable maps. In such verifiers, preserving unmodified facts about the heap acr...
Shuvendu K. Lahiri, Shaz Qadeer
HUC
2004
Springer
14 years 1 months ago
The NearMe Wireless Proximity Server
Abstract. NearMe is a server, algorithms, and application programming interfaces (APIs) for clients equipped with 802.11 wireless networking (Wi-Fi) to compute lists of people and ...
John Krumm, Ken Hinckley