Sciweavers

2555 search results - page 179 / 511
» Quantifiers and Working Memory
Sort
View
ICS
2000
Tsinghua U.
15 years 7 months ago
Using complete system simulation to characterize SPECjvm98 benchmarks
Complete system simulation to understand the influence of architecture and operating systems on application execution has been identified to be crucial for systems design. While t...
Tao Li, Lizy Kurian John, Narayanan Vijaykrishnan,...
CSL
2010
Springer
15 years 4 months ago
Ordered Sets in the Calculus of Data Structures
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Viktor Kuncak, Ruzica Piskac, Philippe Suter
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 3 months ago
An Information-Theoretical View of Network-Aware Malware Attacks
This work investigates three aspects: (a) a network vulnerability as the non-uniform vulnerable-host distribution, (b) threats, i.e., intelligent malwares that exploit such a vulne...
Zesheng Chen, Chuanyi Ji
FGCS
2006
74views more  FGCS 2006»
15 years 3 months ago
A performance model of non-deterministic particle transport on large-scale systems
In this work we present a predictive analytical model that encompasses the performance and scaling characteristics of a nondeterministic particle transport application, MCNP (Mont...
Mark M. Mathis, Darren J. Kerbyson, Adolfy Hoisie
APAL
2002
101views more  APAL 2002»
15 years 3 months ago
The logic of tasks
The paper introduces a semantics for the language of classical first order logic supplemented with the additional operators and . This semantics understands formulas as tasks. An ...
Giorgi Japaridze