A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Concurrent semantic for the pi-calculus
1995
Theoretical Computer Science
Preserved Fulltext
The theory we develop is based on the theory first presented in earlier work on Timed CSP with Roscoe and Schneider, which itself was based on work on unbounded nondeterminism in untimed and Timed CSP ...
and mixed ordering observations, define the corresponding bisimulation relations and discuss them. ...
doi:10.1016/0304-3975(96)80137-x
fatcat:wpso43mvbveqhpemgw3a3pgz3q
Design for testability of protocols based on formal specifications
[chapter]
1996
Protocol Test Systems VIII
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Our models address the problems of controllability and observability, and can handle both sequential and concurrent formal protocol specifications. ...
Since Lamport's pioneering work [Lampo 78], there has been considerable research on the study of concurrency, logical clocks and global states in distributed systems. ...
The generic instrumentation schemes for testability in terms of controllability and observability on sequential specifications, and controllability on concurrent specifications are presented in Section ...
doi:10.1007/978-0-387-34988-6_16
fatcat:a5vvyvabszak7ah4bzmdxuzf64
Denotational models for unblunded nondeterminism
1995
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The theory we develop is based on the theory first presented in earlier work on Timed CSP with Roscoe and Schneider, which itself was based on work on unbounded nondeterminism in untimed and Timed CSP ...
and mixed ordering observations, define the corresponding bisimulation relations and discuss them. ...
doi:10.1016/0304-3975(96)80135-6
fatcat:w3rzvhamxfd2pc3aqkwwxz2no4
Call-by-name, call-by-value, call-by-need and the linear lambda calculus
1995
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The theory we develop is based on the theory first presented in earlier work on Timed CSP with Roscoe and Schneider, which itself was based on work on unbounded nondeterminism in untimed and Timed CSP ...
and mixed ordering observations, define the corresponding bisimulation relations and discuss them. ...
doi:10.1016/0304-3975(96)80134-4
fatcat:4ntj5x42wvhwvbgykaxqfko64a
Universality and powerdomains
1995
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The theory we develop is based on the theory first presented in earlier work on Timed CSP with Roscoe and Schneider, which itself was based on work on unbounded nondeterminism in untimed and Timed CSP ...
and mixed ordering observations, define the corresponding bisimulation relations and discuss them. ...
doi:10.1016/0304-3975(96)80136-8
fatcat:2llbl5whfnbwjpumlyp6cypsn4
The Problem with Threads
2006
Computer
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Tech), and Mark Miller. ...
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 ...
The physical world is highly concurrent, and our very survival depends on our ability to reason about concurrent physical dynamics. ...
doi:10.1109/mc.2006.180
fatcat:2xr64ouajvd5flqceb7sfrrzq4
Some Bridging Results and Challenges in Classical, Quantum and Computational Randomness
[chapter]
2011
Randomness Through Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
nature of nondeterminism in concurrency. ...
In all the above investigations nondeterminism plays a central role: since in concurrency there is no backtracking, it becomes important to control nondeterminism as much as possible, and the expressive ...
doi:10.1142/9789814327756_0005
fatcat:axcog2svzneffffynrglc4llpu
Page 476 of Mathematical Reviews Vol. , Issue 94a
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Causal equivalences semantically distin- guish concurrency from nondeterminism by admitting observations of the causal structure of the observed system. ...
The authors examine the distinctions between concurrent processes based on observable outcomes of computational experiments. ...
Turning nondeterminism into parallelism
2013
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper investigates the problem of utilizing parallelism due to nondeterminism. We observe that nondeterminism occurs in many real-world codes. ...
Nondeterminism is a useful and prevalent concept in the design and implementation of software systems. ...
Contributions We make the following contributions: Nondeterminism and Specialization We take a first step in developing a concurrent programming paradigm that turns latent nondeterminism into a source ...
doi:10.1145/2544173.2509533
fatcat:kz7qmatrercodgfvev4jv6rvmy
Two challenges in embedded systems design: predictability and robustness
2008
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We suggest how predictability can be formalized as a form of determinism, and robustness, as a form of continuity. ...
We discuss two main challenges in embedded systems design: the challenge to build predictable systems, and the challenge to build robust systems. ...
Support for this work was provided by the National Science Foundation under the ITR grant CCR-0225610 and by the ArtistDesign and COMBEST projects of the European Union. ...
doi:10.1098/rsta.2008.0141
pmid:18672451
fatcat:ezefhxs62ffplgk4nedqilykge
Turning nondeterminism into parallelism
2013
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications - OOPSLA '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper investigates the problem of utilizing parallelism due to nondeterminism. We observe that nondeterminism occurs in many real-world codes. ...
Nondeterminism is a useful and prevalent concept in the design and implementation of software systems. ...
Contributions We make the following contributions: Nondeterminism and Specialization We take a first step in developing a concurrent programming paradigm that turns latent nondeterminism into a source ...
doi:10.1145/2509136.2509533
dblp:conf/oopsla/TrippKS13
fatcat:wxruqffjg5bjrc6fqgw7c237ly
Page 8287 of Mathematical Reviews Vol. , Issue 2001K
[page]
2001
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(RS-AOSSI-IS; Novosibirsk)
Analysis of timed concurrent models based on testing equivalence. (English summary)
Concurrency, specification and programming (Warsaw, 1999). Fund. ...
There have been several notions of nondeterminism worked out, such as de- monic, angelic, and erratic nondeterminism. ...
Finding and Reproducing Heisenbugs in Concurrent Programs
2008
USENIX Symposium on Operating Systems Design and Implementation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
CHESS has been integrated into the test frameworks of many code bases inside Microsoft and is used by testers on a daily basis. ...
Concurrency is pervasive in large systems. Unexpected interference among threads often results in "Heisenbugs" that are extremely difficult to reproduce and eliminate. ...
Finally, we would like to thank Terence Kelly, our shepherd, and our anonymous reviewers for invaluable feedback on the original version of this paper. ...
dblp:conf/osdi/MusuvathiQBBNN08
fatcat:woqyt2dmdrh5das5xesa3f2dby
Lightweight Record-and-Replay for Intermittent Tests Failures
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We evaluated the effectiveness of lightweight RR on Servo, a highly concurrent web browser. ...
In contrast to traditional "fully deterministic" RR solutions, lightweight RR focuses on handling nondeterminism arising from thread communication for programs with concurrent, message-passing architectures ...
Lightweight RR does not attempt to provide faithful full program record and replay. Instead, it lowers the amount of nondeterminism inherent to concurrent systems. ...
arXiv:1909.03111v1
fatcat:pbld2ebi7fgbbnhwwma6rtktau
Partial-evaluation techniques for concurrent programs
1997
Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '97
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Based on the binding-time annotations, a specialization transformation is defined and proved correct. ...
However, a simple approximate analysis for detecting and removing redundant synchronizations from the residual program (i.e. synchronizations whose removal does not increase the nondeterminism of a program ...
Acknowledgements: We are grateful to Olivier Danvy and the anonymous reviewers for their comments. ...
doi:10.1145/258993.259002
dblp:conf/pepm/MarinescuG97
fatcat:y7p3zexlcffyzjrmlfuz76bgg4
« Previous
Showing results 1 — 15 out of 5,985 results