Filters








654 Hits in 4.2 sec

The Problem with Threads

E.A. Lee
2006 Computer  
Acknowledgments I acknowledge the thought-provoking comments and suggestions from Joe Buck (Synopsys), Mike Burrows (Google), Stephen Edwards (Columbia), Jim Larus (Microsoft), Sandeep Shukla (Virginia  ...  Many general-purpose parallel architectures in use today-such as symmetric multiprocessors-are direct hardware realizations of the thread abstraction.  ...  prune away more of the nondeterminism.  ... 
doi:10.1109/mc.2006.180 fatcat:2xr64ouajvd5flqceb7sfrrzq4

Interactive foundations of computing

Peter Wegner
1998 Theoretical Computer Science  
The extension of Turing to interaction machines parallels that of the lambda to the pi calculus.  ...  Part I of this paper examines extensions to interactive models for algorithms, machines, grammars, and semantics, while Part II considers the expressiveness of different forms of interaction.  ...  , characteristic of chaos abstraction: hiding of inner actions causes nondeterminism, granularity causes quantum eflects The nondeterminism of quantum theory is due to abstraction effects that make "chaotic  ... 
doi:10.1016/s0304-3975(97)00154-0 fatcat:jfv7xn5nlveqjagut2rkidjdem

Page 4671 of Mathematical Reviews Vol. , Issue 83k [page]

1983 Mathematical Reviews  
Halpern and Jerzy Tiuryn, On the power of nondeterminism in dynamic logic (pp. 48-60); A. Bertoni, G. Mauri and N.  ...  Kirkpatrick, Fast detection of polyhedral intersections (pp. 154-165); Pavol Duri$ and Zvi Galil, On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown  ... 

Page 467 of Mathematical Reviews Vol. , Issue 89A [page]

1989 Mathematical Reviews  
The languages studied are abstractions of the parallel object-oriented language POOL for which we have designed sepa- rate operational and denotational semantics in earlier work.  ...  This paper provides a full analysis of the relationship between the two semantics for these abstractions.  ... 

A theory for nondeterminism, parallelism, communication, and concurrency

Manfred Broy
1986 Theoretical Computer Science  
So the language allows to treat the basic semantic notions of nondeterminism, parallelism, communication, and concurrency for multiprogramming in a completely formal, applicative framework.  ...  Operational semantics is described in the form of term rewriting rules, consistent with the mathematical semantics.  ...  In the field of nondeterministic, parallel, communicating, concurrent programs the state of the art is less satisfactory.  ... 
doi:10.1016/0304-3975(86)90040-x fatcat:deaevefkgrc2nkg4qbcahq2bca

Semantics of communicating processes

Manfred Broy
1984 Information and Control  
An operational semantics is given by term rewriting rules and a consistent fully abstract denotational semantics is defined based on the concept of observable behavior and advanced fixed point theory.  ...  Finally some aspects and problems of the formal definition of the semantics of such a language are treated also comparing them to other approaches found in the literature.  ...  In systems based on shared memory one has to consider streams of states, in tightly coupled systems one has to consider streams of actions.  ... 
doi:10.1016/s0019-9958(84)80048-0 fatcat:ryegt3iydze57beldudyte37yu

Efficient system-enforced deterministic parallelism

Amittai Aviram, Shu-Chun Weng, Sen Hu, Bryan Ford
2012 Communications of the ACM  
We introduce a new parallel programming model addressing these issues, and use Determinator, a proof-of-concept OS, to demonstrate the model's practicality.  ...  Coarse-grained parallel benchmarks perform and scale comparably to nondeterministic systems, on both multicore PCs and across nodes in a distributed cluster.  ...  Acknowledgments We thank Zhong Shao, Ramakrishna Gummadi, Frans Kaashoek, Nickolai Zeldovich, Sam King, and the OSDI reviewers for their valuable feedback.  ... 
doi:10.1145/2160718.2160742 fatcat:7ptdywth7jffvawn7vsatlmts4

Combining the Box Structure Development Method and CSP for Software Development

Philippa J. Hopcroft, Guy H. Broadfoot
2005 Electronical Notes in Theoretical Computer Science  
It integrates well into an industrial setting and forms an ideal bridge between the actual system being developed and the abstract models used for formal analysis.  ...  CSP complements BSDM by providing the mathematical framework for formal verification, together with its model checker FDR.  ...  Acknowledgement We thank Bill Roscoe and Michael Goldsmith for useful discussions and comments on this work. This research is funded by Verum Consultants, The Netherlands.  ... 
doi:10.1016/j.entcs.2005.04.008 fatcat:7hel7lniifg43irkn6fbvkwi7e

Algebraic approaches to nondeterminism---an overview

Michał Walicki, Sigurd Meldal
1997 ACM Computing Surveys  
In computing science, however, nondeterminism has been an issue from the very beginning, if only in the form of nondeterministic Turing machines or nondeterministic finite state machines.  ...  In terms of the automata theory this amounts to viewing each nondeterministic finite state machine NM as a set of deterministic machines {DM z } zʦZ , each accepting exactly one string from the language  ... 
doi:10.1145/248621.248623 fatcat:5o2gkoijefg7dgznddcqefpkbi

Page 2079 of Mathematical Reviews Vol. , Issue 87d [page]

1987 Mathematical Reviews  
Jouvelot, Parallelization by semantic detection of reductions (pp. 223-236); Joost N.  ...  Stark, Proving entailment be- tween conceptual state specifications (extended abstract) (pp. 197- 209); Remi Triolet, Paul Feautrier and Francois Irigoin, Automatic parallelization of FORTRAN programs  ... 

Page 4493 of Mathematical Reviews Vol. , Issue 87h [page]

1987 Mathematical Reviews  
Summary: “We examine the joint influence of fairness and asyn- chrony on the semantic modelling of a CCS-like language.  ...  A fully abstract model of the preorder is constructed in a domain of infinitary languages, preferred here to classical algebraic domains. The restriction to bounded parallelism is anlaysed.  ... 

Underspecification, Inherent Nondeterminism and Probability in Sequence Diagrams [chapter]

Atle Refsdal, Ragnhild Kobro Runde, Ketil Stølen
2006 Lecture Notes in Computer Science  
One is to express underspecification, which means that the specifier for the same environment behavior allows several alternative behaviors of the specified component and leaves the choice between these  ...  STAIRS is an approach to the compositional and incremental development of sequence diagrams supporting underspecification as well as inherent nondeterminism.  ...  The research on which this paper reports has been partly carried out within the context of the IKT-2010 project SARDAS (15295/431) and the IKT SOS project ENFORCE (164382/V30), both funded by the Research  ... 
doi:10.1007/11768869_12 fatcat:pfyimn3h2ber5kbfswascbqrzi

Actor Model of Computation: Scalable Robust Information Systems [article]

Carl Hewitt
2015 arXiv   pre-print
The Actor model is a mathematical theory that treats "Actors" as the universal primitives of concurrent digital computation.  ...  The model has been used both as a framework for a theoretical understanding of concurrency, and as the theoretical basis for several practical implementations of concurrent systems.  ...  Acknowledgements Important contributions to the semantics of Actors have been made by: Gul Agha, Beppe Attardi, Henry Baker, Will Clinger, Irene Greif, Carl Manning, Ian Mason, Ugo Montanari, Maria Simi  ... 
arXiv:1008.1459v38 fatcat:x3qe3cpbnjgkxafsw3lkhw2ucm

Efficient System-Enforced Deterministic Parallelism [article]

Amittai Aviram, Shu-Chun Weng, Sen Hu, Bryan Ford
2010 arXiv   pre-print
The system runs parallel applications deterministically both on multicore PCs and across nodes in a cluster.  ...  Running parallel programs deterministically is usually difficult and costly, however - especially if we desire system-enforced determinism, ensuring precise repeatability of arbitrarily buggy or malicious  ...  The Determinator version of matmult is 34% the size of its Linux equivalent (90 lines versus 263), which passes data via TCP.  ... 
arXiv:1005.3450v1 fatcat:2zzzgu5q3vcltklzvmlc6b4ccq

Abstract Communication Model for Distributed Systems

U. Glasser, Y. Gurevich, M. Veanes
2004 IEEE Transactions on Software Engineering  
The generality of the model has been confirmed by its successful reuse for very different distributed architectures. The model is based on distributed abstract state machines.  ...  Index Terms-Abstract state machines, communication protocols, computer networks, distributed systems, requirement specification, system modeling, testing of distributed systems. ae INTRODUCTION A couple  ...  ACKNOWLEDGMENTS The authors would like to thank the anonymous referees for valuable critique, comments, and suggestions on an earlier draft of this paper.  ... 
doi:10.1109/tse.2004.25 fatcat:qiqzx5rm5za4lfrsu532ovdcwy
« Previous Showing results 1 — 15 out of 654 results