نتایج جستجو برای: mousa abadi

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

Journal: :Electr. Notes Theor. Comput. Sci. 2006
Lars Birkedal Rasmus Ejlers Møgelberg Rasmus Lerchedahl Petersen

We present a formalization of a version of Abadi and Plotkin’s logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show, following Plotkin’s suggestions, that it can be used to define a wide collection of types, including solutions to recursive domain equations. We further define a notion of parametric LAPL-structure and prove that it provid...

Journal: :CoRR 2015
Martín Abadi Ashish Agarwal Paul Barham Eugene Brevdo Zhifeng Chen Craig Citro Gregory S. Corrado Andy Davis Jeffrey Dean Matthieu Devin Sanjay Ghemawat Ian J. Goodfellow Andrew Harp Geoffrey Irving Michael Isard Yangqing Jia Rafal Józefowicz Lukasz Kaiser Manjunath Kudlur Josh Levenberg Dan Mané Rajat Monga Sherry Moore Derek Gordon Murray Chris Olah Mike Schuster Jonathon Shlens Benoit Steiner Ilya Sutskever Kunal Talwar Paul A. Tucker Vincent Vanhoucke Vijay Vasudevan Fernanda B. Viégas Oriol Vinyals Pete Warden Martin Wattenberg Martin Wicke Yuan Yu Xiaoqiang Zheng

Martı́n Abadi, Ashish Agarwal, Paul Barham, Eugene Brevdo, Zhifeng Chen, Craig Citro, Greg S. Corrado, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Ian Goodfellow, Andrew Harp, Geoffrey Irving, Michael Isard, Yangqing Jia, Rafal Jozefowicz, Lukasz Kaiser, Manjunath Kudlur, Josh Levenberg, Dan Mané, Rajat Monga, Sherry Moore, Derek Murray, Chris Olah, Mike Schuster, Jonathon Shlens,...

Journal: :Electr. Notes Theor. Comput. Sci. 2005
Ricardo Corin Jeroen Doumen Sandro Etalle

We study the security of password protocols against off-line dictionary attacks. In addition to the standard adversary abilities, we also consider further cryptographic advantages given to the adversary when considering the password protocol being instantiated with particular encryption schemes. We work with the applied pi calculus of Abadi and Fournet, in which the (new) adversary abilities ar...

2002
Harry G. Mairson

We give a first-principles description of the context semantics of Gonthier, Abadi, and Lévy, a computer-science analogue of Girard’s geometry of interaction. We explain how this denotational semantics models λ-calculus, and more generally multiplicative-exponential linear logic (MELL), by explaining the call-by-name (CBN) coding of the λcalculus, and proving the correctness of readback, where ...

Journal: :JDIM 2013
Dong Sun Dan Liu

During recent years,RFID technology has a wide applications in many fields.Since singnal transmit by the radio frequency, it raises many security and privacy concerns. Ownership transfer of RFID tags is another requriement for RFID systems. During the life of tag, it may pass from manufacutrer to commercial agent, the ownership of tag need change correspondingly.Taking into account the natural ...

1991
Rajashekar Kailar Virgil D. Gligor

Authentication protocols can be viewed from the perspective of the evolution of beliefs within a protocol run. Inference rules which ensue from this perspective are presented. These rules can be used to analyze the protocols which the BAN logic 1] can analyze. Additional protocols that can be analyzed include (1) inter-domain authentication where principals must trust all authen-tication server...

2017
Joseph Y. Halpern Ron van der Meyden Riccardo Pucella

While there have been many attempts, going back to BAN logic, to base reasoning about security protocols on epistemic notions, they have not been all that successful. Arguably, this has been due to the particular logics chosen. We present a simple logic based on the well-understood modal operators of knowledge, time, and probability, and show that it is able to handle issues that have often bee...

1999
David Monniaux

Belief-logic deductions are used in the analysis of cryptographic protocols. We show a new method to decide such logics. In addition to the familiar BAN logic, it is also applicable to the more advanced versions of protocol security logics, and GNY in particular; and it employs an efficient forward-chaining algorithm the completeness and termination of which are proved. Theoretic proofs, implem...

2010
Michele Bugliesi Stefano Calzavara Damiano Macedonio

We introduce a calculus with mobile names, distributed principals and primitives for secure remote communication, without any reference to explicit cryptography. The calculus is equipped with a system of types and effects providing static guarantees of secrecy and authenticity in the presence of a Dolev-Yao intruder. The novelty with respect to existing type systems for security is in the struc...

2006
Vasileios Koutavas Mitchell Wand

We present a sound and complete method for reasoning about contextual equivalence in the untyped, imperative object calculus of Abadi and Cardelli [1]. Our method is based on bisimulations, following the work of Sumii and Pierce [25, 26] and our own [14]. Using our method we were able to prove equivalence in more complex examples than the ones of Gordon, Hankin and Lassen [7] and Gordon and Ree...

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

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