نتایج جستجو برای: concurrent

تعداد نتایج: 62100  

2002
T. Naylor

I outline the evidence pertinent to the connection between the nova explosion and mass transfer rates in CVs. I conclude that there is still insufficient evidence to decide whether or not such a connection exists.

2007
STEVE JACKSON

We announce results concerning the detailed analysis of L(R) a considerable distance along its constructibility hierarchy, assuming the axiom of determinacy. Our main focus here is on the projective hierarchy, and specifically the sizes and properties of the projective ordinals. In particular, assuming determinacy, we calculate the values of the projective ordinals, getting

2017
Leonardo Weiss-Cohen Emmanouil Konstantinidis Maarten Speekenbrink Nigel Harvey

Warning labels can be considered as descriptions added to repeated decisions-from-experience. Limited research so far has looked at the theoretical integration of decisions from descriptions and decisions from experience when the two are available concurrently. We explore how the presence and timing of such warning labels influence behaviour. We expected the provision of warning labels to subse...

2006
Brijesh Dongol Arjan J. Mooij

We present some techniques to obtain smooth derivations of concurrent programs that address both safety and progress in a formal manner. Our techniques form an extension to the calculational method of Feijen and van Gasteren using a UNITY style progress logic. We stress the role of stable guards, and we illustrate the derivation techniques on some examples in which progress plays an essential r...

2009
K. Rustan M. Leino Peter Müller Jan Smans

A program verifier is a tool that allows developers to prove that their code satisfies its specification for every possible input and every thread schedule. These lecture notes describe a verifier for concurrent programs called Chalice. Chalice’s verification methodology centers around permissions and permission transfer. In particular, a memory location may be accessed by a thread only if that...

Journal: :Computational Intelligence 1998
Munindar P. Singh

A clear understanding and formalization of actions is essential to computing, and especially so to reasoning about and constructing intelligent agents. Several approaches have been proposed over the years. However, most approaches concentrate on the causes and eeects of actions, but do not give general characterizations of actions themselves. A useful formalization of actions would be based on ...

2007
Daniel Jesus Valencia Sanchez

OF THE DISSERTATION XI

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید