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

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

2016
Nachiket Deo Daniel J. Abadi Daniel S. Myers David J. DeWitt Samuel R. Madden Stratos Idreos Samuel Madden

1. Daniel J. Abadi ,Daniel S. Myers, David J. DeWitt, Samuel R. Madden. Materialization Strategies in a Column-Oriented DBMS. Proceedings of ICDE 2007, Istanbul, Turkey. 2. Daniel J. Abadi, Samuel R. Madden, Nabil hachem. Column-Store vs Row-store How different are they really? SIGMOD’08, June 9–12, 2008, Vancouver, BC, Canada 3. Daniel Abadi,PeterBoncz,Stavros Harizopoulos, Stratos Idreos, Sam...

2006
L. Birkedal

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 existential types, inductive types, coinductive types and general recursive types. We show that the recursive types satis...

1994
Catherine A. Meadows

In this paper we develop a model of computation for the NRL Protocol Analyzer by modifying and extending the model of computation for Burroughs, Abadi, and Needham (BAN) logic developed by Abadi and Tuttle. We use the results to point out the similarities and di erences between the NRL Protocol Analyzer and BAN logic, and discuss the issues this raises with respect to the possible integration o...

2008
Olivier Danvy Jacob Johannsen

We present a new abstract machine for Abadi and Cardelli’s untyped calculus of objects. What is special about this semantic artifact (i.e., man-made construct) is that is mechanically corresponds to both the reduction semantics (i.e., small-step operational semantics) and the natural semantics (i.e., big-step operational semantics) specified in Abadi and Cardelli’s monograph. This abstract mach...

2001
Nesria Agray Wiebe van der Hoek Erik P. de Vink

This paper reports on two case-studies of applying BAN logic to industrial strength security protocols. These studies demonstrate the flexibility of the BAN language, as it caters for the addition of appropriate constructs and rules. We argue that, although a semantical foundation of the formalism is lacking, BAN logic provides an intuitive and powerful technique for security analysis.

Journal: :Syi`ar Iqtishadi 2023

Mudharabah funding is one of product that use collaboration agreement on BMT Rukun Abadi. Abadi need accounting information system in every transaction, so the distribution mudharabah process can run effectively and efficiently. Accounting internal control Abadi, procedure done agree with plans for reaching goals have been set. The application still very simple, it makes can’t be maximized. pur...

2003
Tim Storer

Concerns are often raised as to the safety of remote voting systems (and indeed polling station voting systems) when conducted using electronic equipment. Here, a formal analysis is conducted of the UK postal ballot system in order to demonstrate that some of the concerns regarding remote electronic voting are as applicable to remote paper based system.

Journal: :Electr. Notes Theor. Comput. Sci. 2002
Hans Hüttel

The spi-calculus, proposed by Abadi and Gordon, is a process calculus based on the π-calculus and is intended for reasoning about the behaviour of cryptographic protocols. We consider the finite-control fragment of the spi-calculus, showing it to be Turing-powerful (a result which is joint work with Josva Kleist, Uwe Nestmann, and Björn Victor.) Next, we restrict our attention to finite (non-re...

Journal: :Logical Methods in Computer Science 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 existential types, inductive types, coinductive types and general recursive types. We show that the recursive types satisfy...

2001
Chiara Bodei Pierpaolo Degano Flemming Nielson Hanne Riis Nielson

We introduce the νSPI-calculus that strengthens the notion of “perfect symmetric cryptography” of the spi-calculus by taking time into account. This involves defining an operational semantics, defining a control flow analysis (CFA) in the form of a flow logic, and proving semantic correctness. Our first result is that secrecy in the sense of DolevYao can be expressed in terms of the CFA. Our se...

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

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