Sciweavers

6829 search results - page 979 / 1366
» Quantitative Generalizations of Languages
Sort
View
166
Voted
PLDI
2006
ACM
16 years 25 days ago
Combining type-based analysis and model checking for finding counterexamples against non-interference
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa
231
Voted
PPOPP
2006
ACM
16 years 25 days ago
McRT-STM: a high performance software transactional memory system for a multi-core runtime
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed t...
Bratin Saha, Ali-Reza Adl-Tabatabai, Richard L. Hu...
195
Voted
UIST
2006
ACM
16 years 24 days ago
Translating keyword commands into executable code
Modern applications provide interfaces for scripting, but many users do not know how to write script commands. However, many users are familiar with the idea of entering keywords ...
Greg Little, Robert C. Miller
192
Voted
VEE
2006
ACM
102views Virtualization» more  VEE 2006»
16 years 24 days ago
A stackless runtime environment for a Pi-calculus
The Pi-calculus is a formalism to model and reason about highly concurrent and dynamic systems. Most of the expressive power of the language comes from the ability to pass communi...
Frédéric Peschanski, Samuel Hym
KBSE
2005
IEEE
16 years 13 days ago
An analysis of rule coverage as a criterion in generating minimal test suites for grammar-based software
The term grammar-based software describes software whose input can be specified by a context-free grammar. This grammar may occur explicitly in the software, in the form of an in...
Mark Hennessy, James F. Power