scholarly journals Editorial for Volume 9 Issue 2

2019 ◽  
Vol 9 (2) ◽  
Author(s):  
Jonathan Ullman ◽  
Lars Vilhuber
Keyword(s):  
Social Sciences ◽  
Computer Security ◽  
Programming Languages ◽  
Differential Privacy ◽  
Census Bureau ◽  
Theory And Practice ◽  
Mining Machine ◽  
Special Issue ◽  
Worst Case ◽  
High Degree

Differential privacy is a promising approach to privacy-preserving data analysis that provides strong worst-case guarantees about the harm that a user could suffer from contributing their data, but is also flexible enough to allow for a wide variety of data analyses to be performed with a high degree of utility. Researchers in differential privacy span many distinct research communities, including algorithms, computer security, cryptography, databases, data mining, machine learning, statistics, programming languages, social sciences, and law. Two articles in this issue describe applications of differentially private, or nearly differentially private, algorithms to data from the U.S. Census Bureau. A  third article highlights a thorny issue that applies to all implementations of differential privacy: how to choose the key privacy parameter ε, This special issue also includes selected contributions from the 3rd Workshop on Theory and Practice of Differential Privacy, which was held in Dallas, TX on October 30, 2017 as part of the ACM Conference on Computer Security (CCS).

scholarly journals Special Issue on the Theory and Practice of Differential Privacy

2017 ◽  
Vol 7 (2) ◽  
Author(s):  
Marco Gaboardi ◽  
Chris J. Skinner
Keyword(s):  
Data Analysis ◽  
Programming Languages ◽  
Differential Privacy ◽  
International Workshop ◽  
Theory And Practice ◽  
Release Mechanism ◽  
Special Issue ◽  
Research Areas ◽  
Recent Developments ◽  
Definition Of

This special issue presents papers based on contributions to the first international workshop on the “Theory and Practice of Differential Privacy” (TPDP) held in London, UK, 18 April 2015, as part of the European joint conference on Theory And Practice of Software (ETAPS). Differential privacy is a mathematically rigorous definition of the privacy protection provided by a data release mechanism: it offers a strong guaranteed bound on what can be learned about a user as a result of participating in a differentially private data analysis. Researchers in differential privacy come from several areas of computer science, including algorithms, programming languages, security, databases and machine learning, as well as from several areas of statistics and data analysis. The workshop was intended to be an occasion for researchers from these different research areas to discuss the recent developments in the theory and practice of differential privacy. The program of the workshop included 10 contributed talks, 1 invited speaker and 1 joint invited speaker with the workshop “Hot Issues in Security Principles and Trust” (HotSpot 2016). Participants at the workshop were invited to submit papers to this special issue. Six papers were accepted, most of which directly reflect talks presented at the workshop

scholarly journals Editorial for Special Issue on the Theory and Practice of Differential Privacy 2018

2020 ◽  
Vol 10 (1) ◽  
Author(s):  
Aleksandar Nikolov ◽  
Lars Vilhuber
Keyword(s):  
Computer Security ◽  
Differential Privacy ◽  
Theory And Practice ◽  
Special Issue

This special issue  includes selected contributions from the 4th Workshop on Theory and Practice of Differential Privacy, which was held in Toronto, Canada on 15 October 2018 as part of the ACM Conference on Computer Security (CCS).

scholarly journals Theory and applications of explicit substitutions: Introduction

2001 ◽  
Vol 11 (1) ◽  
pp. 1-1 ◽  
Author(s):  
Delia Kesner
Keyword(s):  
Programming Languages ◽  
Theory And Practice ◽  
Special Issue ◽  
Flexible Tool ◽  
Mathematical Structures ◽  
Meta Level ◽  
Refereeing Process ◽  
Explicit Substitutions ◽  
Community Of Researchers ◽  
Object Level

This special issue of Mathematical Structures in Computer Science is dedicated to the theory and applications of explicit substitutions, which have attracted a growing community of researchers in the last decade, especially in the study of explicit substitutions as a means of bridging the gap between theory and practice in the implementation of programming languages, as well as theorem provers and proof checkers.Such implementations typically rely on formal calculi defined using implicit substitution operations that are left at the meta-level, so that they need to turn these meta-level operations into efficient executable code, and this is often fairly intricate and distant from the formal calculi. This causes a significant gap between theory and practice.Explicit substitutions considerably reduce this gap by bringing the meta-level operations down to the object-level calculus – where they are represented explicitly – allowing us in this way to give formal and robust models for the techniques actually used in implementations, and providing at the same time a more flexible tool for controlling the intermediate steps of evaluation.All the papers in this issue were invited on the basis of their quality and relevance to the domain, and subjected to the refereeing process of MSCS. Most of them are substantially expanded and revised versions of work originally presented at Westapp'98 and Westapp'99, the first and second ‘Workshop on Explicit Substitutions: Theory and Applications to Programs and Proofs’, which were held in conjunction with RTA'98 in Tsukuba, Japan, and with Floc'99 in Trento, Italy, respectively.As guest editor, I would like to express my warm thanks both to the authors, for their high-quality contributions to this special issue, and to the referees, whose scientific role was essential in improving the presentation of these contributions.

Theory and applications of subtyping: Introduction

2008 ◽  
Vol 18 (5) ◽  
pp. 795-796
Author(s):  
ADRIANA COMPAGNONI ◽  
HEALFDENE GOGUEN
Keyword(s):  
Computer Science ◽  
Programming Languages ◽  
Programming Language ◽  
Flow Analysis ◽  
Theory And Practice ◽  
Dependent Types ◽  
Special Issue ◽  
New Approach ◽  
Mathematical Structures ◽  
Theoretical Issues

This special issue of Mathematical Structures in Computer Science is devoted to recent work in subtyping. When subtyping was first proposed, it presented a new vehicle for understanding programming languages, together with challenging theoretical issues. The papers in this special issue include a new approach to the decidability of subtyping, a metatheoretic investigation of transitivity of coercive subtyping for parametrised dependent types, and applications of subtyping to the classic programming language concerns of flow analysis and typing for distributed systems. We believe that the scope of the papers demonstrates convincingly that the theory and practice of subtyping continue to be extended in novel and interesting ways.

scholarly journals Expansion, perspectives, and challenges

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Lars Vilhuber
Keyword(s):  
Computer Security ◽  
Differential Privacy ◽  
Privacy Preserving ◽  
Theory And Practice ◽  
Present Issue ◽  
Large Expansion ◽  
Diverse Community ◽  
Privacy And Confidentiality ◽  
New Phase

The present issue heralds a new phase for the Journal. In our ongoing efforts to provide a forum for a diverse community interested in privacy and confidentiality, we welcome a large expansion of the editorial board. We also introduce not one, but two new sections to the Journal. Perspectives are shorter articles, possibly somewhat opiniated, typically clustered around a same theme. The section on Privacy Challenges encompasses articles that describe practical implementations of privacy-preserving algorithms from a variety of competitions, starting with the NIST PSCR Challenge from 2018-2019. As every year, we also publish select contributions from the Workshop on Theory and Practice of Differential Privacy, which in 2019 was held in London, UK as part of the ACM Conference on Computer Security (CCS).

Introduction Special Issue on Multiparadigm Languages and Constraint Programming

2007 ◽  
Vol 7 (1-2) ◽  
pp. 1-2
Author(s):  
MORENO FALASCHI ◽  
MICHAEL MAHER
Keyword(s):  
Logic Programming ◽  
Programming Languages ◽  
Constraint Programming ◽  
Theory And Practice ◽  
Special Issue ◽  
Implementation Effort ◽  
Selection Of

In recent years much research and implementation effort has been devoted both to multiparadigm languages and constraint programming languages. Following up on a series of 11 workshops (WFLP) on multiparadigm languages and constraint programming, and as a result of an open call for submissions, the journal on Theory and Practice of Logic Programming is now publishing the results of the selection of the papers submitted to this special issue.

Critical self-reflection: A performative act 批判的自己内省 ―パフォーマティヴな実践―

2010 ◽  
Vol 34 (4) ◽  
pp. 49
Author(s):  
Misako Tajima
Keyword(s):  
Social Sciences ◽  
Secondary School ◽  
School Teacher ◽  
Theory And Practice ◽  
English Learner ◽  
Academic Journal ◽  
Self Reflection ◽  
Academic Fields ◽  
Global Spread ◽  
The Relationship

Autobiographic and narrative research has recently grown in stature in the field of social sciences. Inspired by Asian TESOL researchers’ critical analyses of self-stories, this paper attempts to reflect upon the author’s personal history in relation to English and discuss ways in which she can position herself as both an English learner and a non-native English speaker (NNES) teacher. The self-reflection and discussion is followed by an argument for performativity, a notion drawing on poststructuralism to understand language itself and the global spread of English. This paper, itself a performative act conducted by a secondary school teacher, exemplifies the concept. The non-academic schoolteacher’s very act of writing in an academic journal aims to contribute to questioning assumptions underlying the relationship between theory and practice and to reconstituting the academic fields of applied linguistics and TESOL. 近年、自伝的かつ語りを含む研究が社会科学の分野で活発になってきている。本稿では、TESOLを専門とする、あるアジア人研究者が彼女たち自身の物語を素材として実施した批判的分析に着想を得て、英語にまつわる自己の歴史を振り返り、英語学習者としての、またNNESの英語教師としてのポジショナリティをどこに位置づけるのかという問題について議論する。さらに、この批判的自己内省を経て、言語そのもの、あるいは英語という言語の地球規模的広がりを理解するために、ポスト構造主義の概念であるパフォーマティヴィティについて検証する。なお、本稿これ自体がある高校教師によるパフォーマティヴな実践であることに言及しておきたい。研究者ではなく、一高校教師が学術雑誌に投稿することを通じ、理論と実践の関係性の背後にある前提に疑問を投げかけ、その結果、応用言語学やTESOLという学問分野の再構築に貢献できることを希望している。

Enriched Meanings

2020 ◽  
Author(s):  
Ash Asudeh ◽  
Gianluca Giorgolo
Keyword(s):  
Cognitive Science ◽  
Programming Languages ◽  
Category Theory ◽  
Worst Case ◽  
Disciplinary Boundaries ◽  
Semantics Of Programming Languages ◽  
Basic Meaning ◽  
Language Interpretation ◽  
Major Branch ◽  
Compositional Properties

This book presents a theory of enriched meanings for natural language interpretation. Certain expressions that exhibit complex effects at the semantics/pragmatics boundary live in an enriched meaning space while others live in a more basic meaning space. These basic meanings are mapped to enriched meanings just when required compositionally, which avoids generalizing meanings to the worst case. The theory is captured formally using monads, a concept from category theory. Monads are also prominent in functional programming and have been successfully used in the semantics of programming languages to characterize certain classes of computation. They are used here to model certain challenging linguistic computations at the semantics/pragmatics boundary. Part I presents some background on the semantics/pragmatics boundary, informally presents the theory of enriched meanings, reviews the linguistic phenomena of interest, and provides the necessary background on category theory and monads. Part II provides novel compositional analyses of the following phenomena: conventional implicature, substitution puzzles, and conjunction fallacies. Part III explores the prospects of combining monads, with particular reference to these three cases. The authors show that the compositional properties of monads model linguistic intuitions about these cases particularly well. The book is an interdisciplinary contribution to Cognitive Science: These phenomena cross not just the boundary between semantics and pragmatics, but also disciplinary boundaries between Linguistics, Philosophy and Psychology, three of the major branches of Cognitive Science, and are here analyzed with techniques that are prominent in Computer Science, a fourth major branch. A number of exercises are provided to aid understanding, as well as a set of computational tools (available at the book's website), which also allow readers to develop their own analyses of enriched meanings.

CSim 2

2021 ◽  
Vol 43 (1) ◽  
pp. 1-46
Author(s):  
David Sanan ◽  
Yongwang Zhao ◽  
Shang-Wei Lin ◽  
Liu Yang
Keyword(s):  
Programming Languages ◽  
Concurrent Systems ◽  
Theorem Prover ◽  
Compositional Techniques ◽  
Machine Code ◽  
Top Down ◽  
Hol Theorem Prover ◽  
High Level ◽  
High Degree

To make feasible and scalable the verification of large and complex concurrent systems, it is necessary the use of compositional techniques even at the highest abstraction layers. When focusing on the lowest software abstraction layers, such as the implementation or the machine code, the high level of detail of those layers makes the direct verification of properties very difficult and expensive. It is therefore essential to use techniques allowing to simplify the verification on these layers. One technique to tackle this challenge is top-down verification where by means of simulation properties verified on top layers (representing abstract specifications of a system) are propagated down to the lowest layers (that are an implementation of the top layers). There is no need to say that simulation of concurrent systems implies a greater level of complexity, and having compositional techniques to check simulation between layers is also desirable when seeking for both feasibility and scalability of the refinement verification. In this article, we present CSim 2 a (compositional) rely-guarantee-based framework for the top-down verification of complex concurrent systems in the Isabelle/HOL theorem prover. CSim 2 uses CSimpl, a language with a high degree of expressiveness designed for the specification of concurrent programs. Thanks to its expressibility, CSimpl is able to model many of the features found in real world programming languages like exceptions, assertions, and procedures. CSim 2 provides a framework for the verification of rely-guarantee properties to compositionally reason on CSimpl specifications. Focusing on top-down verification, CSim 2 provides a simulation-based framework for the preservation of CSimpl rely-guarantee properties from specifications to implementations. By using the simulation framework, properties proven on the top layers (abstract specifications) are compositionally propagated down to the lowest layers (source or machine code) in each concurrent component of the system. Finally, we show the usability of CSim 2 by running a case study over two CSimpl specifications of an Arinc-653 communication service. In this case study, we prove a complex property on a specification, and we use CSim 2 to preserve the property on lower abstraction layers.

Sign in / Sign up

Export Citation Format

Share Document