Sciweavers

6155 search results - page 905 / 1231
» A language for multiple models of computation
Sort
View
ICALP
1992
Springer
15 years 10 months ago
Fast Integer Merging on the EREW PRAM
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
Torben Hagerup
AOSD
2007
ACM
15 years 10 months ago
Fully abstract semantics of additive aspects by translation
stract Semantics of Additive Aspects by Translation S. B. Sanjabi C.-H. L. Ong Oxford University Computing Laboratory We study the denotational semantics of an aspect calculus by ...
S. B. Sanjabi, C.-H. Luke Ong
PODC
2010
ACM
15 years 10 months ago
Transactional predication: high-performance concurrent sets and maps for STM
Concurrent collection classes are widely used in multi-threaded programming, but they provide atomicity only for a fixed set of operations. Software transactional memory (STM) pr...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...
CONCUR
2006
Springer
15 years 10 months ago
Minimization, Learning, and Conformance Testing of Boolean Programs
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
AINA
2003
IEEE
15 years 10 months ago
Formal Verification of Condition Data Flow Diagrams for Assurance of Correct Network Protocols
Condition Data Flow Diagrams (CDFDs) are a formalized notation resulting from the integration of Yourdon Data Flow Diagrams, Petri Nets, and pre-post notation. They are used in th...
Shaoying Liu