Sciweavers

1027 search results - page 149 / 206
» Callgraph properties of executables
Sort
View
RTA
2005
Springer
15 years 9 months ago
Intruder Deduction for AC-Like Equational Theories with Homomorphisms
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
Pascal Lafourcade, Denis Lugiez, Ralf Treinen
ASPDAC
2004
ACM
120views Hardware» more  ASPDAC 2004»
15 years 9 months ago
Temporal floorplanning using 3D-subTCG
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang, Hsin-...
SPIN
2004
Springer
15 years 9 months ago
Model-Driven Software Verification
Abstract. In the classic approach to logic model checking, software verification requires a manually constructed artifact (the model) to be written in the language that is accepted...
Gerard J. Holzmann, Rajeev Joshi
KBSE
2003
IEEE
15 years 9 months ago
Automated Environment Generation for Software Model Checking
A key problem in model checking open systems is environment modeling (i.e., representing the behavior of the execution context of the system under analysis). Software systems are ...
Oksana Tkachuk, Matthew B. Dwyer, Corina S. Pasare...
134
Voted
P2P
2003
IEEE
110views Communications» more  P2P 2003»
15 years 9 months ago
Range Addressable Network: A P2P Cache Architecture for Data Ranges
Peer-to-peer computing paradigm is emerging as a scalable and robust model for sharing media objects. In this paper, we propose an architecture and describe the associated algorit...
Anshul Kothari, Divyakant Agrawal, Abhishek Gupta,...