70,455 Hits in 7.2 sec

Relating Process Languages for Security and Communication Correctness (Extended Abstract) [chapter]

Daniele Nantes, Jorge A. Pérez
2018 Lecture Notes in Computer Science  
We establish the correctness of our encoding, and we show how it enables the integrated analysis of security properties and communication correctness by re-using existing tools.  ...  Despite their shared foundations, languages and reasoning techniques for (a) and (b) have been separately developed.  ...  We are grateful to the anonymous reviewers for their useful remarks and suggestions.  ... 
doi:10.1007/978-3-319-92612-4_5 fatcat:zm5driw2ovdp3c4ceqdgsflrau

Extended Abstracts

2010 Cartilage  
Acknowledgments: We acknowledge the EU for financial support ("STEPS"; FP6-#NMP3-CT-2005-500465) Acknowledgments: This study was supported by a grant from the New Energy and Industrial Technology Development  ...  Organization, Japan, and Grantin-Aid for Scientific Research (B), Japan Society for the promotion of Science, Japan.  ...  ICRS unicompartmental knee replacement since the 2007 extended ICRS unicompartmental knee replacement since the 2007 extended ICRS abstract on the topic.1 The term applies to resurfacing either one abstract  ... 
doi:10.1177/1947603510386038 pmid:26075041 pmcid:PMC4300817 fatcat:m2mv3tnf6vhzndubvwdtltkh5y

Abstracting abstract control

James Ian Johnson, David Van Horn
2014 Proceedings of the 10th ACM Symposium on Dynamic languages - DLS '14  
The approach, so called because it derives a function for the sound and computable approximation of program behavior starting from the abstract machine semantics of a language, provides a viable approach  ...  The "abstracting abstract machines" (AAM) approach to constructing static analyses has recently been proposed as a method to ameliorate the difficulty of designing analyses for such language features.  ...  AAM is founded on three ideas: 1. concrete and abstract semantics ideally should use the same code, for correctness and testing purposes, 2. the level of abstraction should be a tunable parameter, 3. both  ... 
doi:10.1145/2661088.2661098 dblp:conf/dls/JohnsonH14 fatcat:jftogwomxjhs3ob62mihglncom

Fuzzy Private Matching (Extended Abstract) [article]

Łukasz Chmielewski, Jaap-Henk Hoepman
2007 arXiv   pre-print
Such a private matching protocol is called fuzzy, and is useful, for instance, when elements may be inaccurate or corrupted by errors.  ...  In the private matching problem, a client and a server each hold a set of n input elements.  ...  Hence, if X i ≈ t Y j then P σ (σ(Y j )) = 0 for some P σ received and evaluated in step 3a.  ... 
arXiv:0710.5425v1 fatcat:dkblydoa7venppbfw6jgyzyyp4

Fuzzy Private Matching (Extended Abstract)

Lukasz Chmielewski, Jaap-Henk Hoepman
2008 2008 Third International Conference on Availability, Reliability and Security  
In the private matching problem, a client and a server each hold a set of n input elements.  ...  The client wants to privately compute the intersection of these two sets: he learns which elements he has in common with the server (and nothing more), while the server gains no information at all.  ...  Note that each time a new word X i from the client is matched with Y j , fresh secret shares are generated to avoid an attack similar to the one described in section 3.  ... 
doi:10.1109/ares.2008.170 dblp:conf/IEEEares/ChmielewskiH08 fatcat:of2ofpydrve23j5pdgd2wo5g7y

A framework for defining Object-Calculi extended abstract [chapter]

Frédéric Lang, Pierre Lescanne, Luigi Liquori
1999 Lecture Notes in Computer Science  
Above all, it introduces and illustrates a new promising approach to formally reason about the operational semantics of languages with (possibly) mutable states. Keywords.  ...  , for the description of the operational semantics and sharing.  ...  The authors are grateful to Zine-El-Abidine Benaissa, Furio Honsell, and Kristoffer Høgsbro Rose for their useful comments on this work.  ... 
doi:10.1007/3-540-48118-4_2 fatcat:4zpj5crq5fcavikxm6zv36lzwy

Partial order programming (extended abstract)

D. S. Parker
1989 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89  
A path from Vi, to vim in G is a sequence of edges , , ' ' ' , in E, and the cost of this path is aili + ai2i3 + ' ' ' + aimtim* For every node Vi, the problem is to compute the node cost Ui, which is  ...  the least cost of all paths between the source vo and Vi.  ...  The author is indebted to many colleagues for suggestions that have corrected or improved the presentation here, but particularly to Paul Eggert for his careful readings, great ideas, and enthusiasm.  ... 
doi:10.1145/75277.75300 dblp:conf/popl/Parker89 fatcat:shlywumy6fdj7jx2zdj3eljwlu

Supply Response in the Northeastern Fresh Tomato Market: Cointegration and Error Correction Analysis

Ananda Weliwita, Ramu Govindasamy
1997 Agricultural and Resource Economics Review  
This paper reexamines supply response in the Northeastern fresh tomato market during the 1949–94 period by employing cointegration and error correction technique.  ...  It tests whether there has been a long-run equilibrium relationship between Northeastern production and a set of price and nonprice factors that influence it.  ...  the data for the phia, Pittsburgh, and Nassau-Suffolk-New 1949-61 and 1987-94 periods.  ... 
doi:10.1017/s1068280500002719 fatcat:g62ovkfzwjer7koopvv6nyayaq

How to withstand mobile virus attacks (extended abstract)

Rafail Ostrovsky, Moti Yung
1991 Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91  
We show how local computations (at each processor) and global computations can be polynomial factor-redundancy in the  ...  We initiate a study of distributed adversarial model of computation in which faults are non-stationary and can move through the net work, analogous to a spread of a virus or a worm.  ...  Acknowledgments We thank Jeff Kephart, Matt Franklin and Steve White for helpful discussions and comments.  ... 
doi:10.1145/112600.112605 dblp:conf/podc/OstrovskyY91 fatcat:dp4ujza57rev7dghzgjj2uthzu

Multiparty Dependent Session Types (Extended Abstract) [article]

Hanwen Wu, Hongwei Xi
2018 arXiv   pre-print
This work formalizes the first multiparty dependent session types as an expressive and practical type discipline for enforcing communication protocols.  ...  Programs are more distributed and concurrent today than ever before, and structural communications are at the core.  ...  Given a thread function, fork creates a new thread and connects to it with a fresh channel c.  ... 
arXiv:1808.00077v1 fatcat:xzms3ivryvaqvinjt7uozhwzu4

Modalities for model checking (extended abstract)

E. Allen Emerson, Chin-Laung Lei
1985 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '85  
Introduce a list of new, "fresh" atomic propositions Q1,...,Qk.  ...  It is straightforward to formalize this approach and to extend our efficient model checking aIgorithm to the extended semantics.  ... 
doi:10.1145/318593.318620 dblp:conf/popl/EmersonL85 fatcat:x6kty74qarhxfhzekz7ey5ypvi

Analyzing and Evaluating Data Freshness in Data Integration Systems

Verónika Peralta, Raúl Ruggia, Mokrane Bouzeghoub
2004 Ingénierie des Systèmes d'Information  
In Chapter 4 we extended the framework for evaluating data accuracy, representing further DIS properties and developing a new evaluation algorithm.  ...  The following sections describe our approach for data freshness evaluation and enforcement: Section 2 describes the framework and presents an overview of the evaluation approach.  ... 
doi:10.3166/isi.9.5-6.145-162 fatcat:mby7k2jdvbe2tfwh3adeeu2qky

Analysing AWN-Specifications Using mCRL2 (Extended Abstract) [chapter]

Rob van Glabbeek, Peter Höfner, Djurre van der Wal
2018 Lecture Notes in Computer Science  
We develop and implement a translation from the process Algebra for Wireless Networks (AWN) into the milli Common Representation Language (mCRL2).  ...  As a consequence of the translation, the sophisticated toolset of mCRL2 is now available for AWN-specifications.  ...  [12, 16] AWN provides the right level of abstraction to model key features of protocols for (wireless) networks such as unicast and broadcast for message sending, while abstracting from implementation-related  ... 
doi:10.1007/978-3-319-98938-9_23 fatcat:tgssmahpwrewfe7epwptutehdy

Type-Based Analysis for Session Inference (Extended Abstract) [chapter]

Carlo Spaccasassi, Vasileios Koutavas
2016 Lecture Notes in Computer Science  
Combining and extending well-known techniques, we develop a type-checking system that separates the underlying ML type system from the typing of sessions.  ...  Without using linearity, our system guarantees communication safety and partial lock freedom. It also supports provably complete session inference for finite sessions with no programmer annotations.  ...  Related work and conclusions can be found in Sect. 8. Details missing from this extended abstract can be found in the appendix for the benefit of the reviewers.  ... 
doi:10.1007/978-3-319-39570-8_17 fatcat:kfgxip265zdlnbbua5dzcssnhm

Mechanized Metatheory Revisited: An Extended Abstract (Invited Paper)

Dale Miller, Michael Wagner
2018 Types for Proofs and Programs  
, for example, de Bruijn numerals and nominal logic features.  ...  In particular, by combining Church's approach to terms and formulas (found in his Simple Theory of Types) and Gentzen's approach to sequent calculus proofs, we can learn how bindings can declaratively  ...  Such properties include type preservation, determinancy of evaluation, and the correctness of an OS microkernel and of various compilers: see, for example, [41, 42, 44, 59] .  ... 
doi:10.4230/lipics.types.2016.1 dblp:conf/types/Miller16 fatcat:ryflgp5aqvh4pjd7x6jff3keky
« Previous Showing results 1 — 15 out of 70,455 results