3 Search Results for "Gulwani, Sumit"

Document

DOI: 10.4230/LIPIcs.FSCD.2024.12

A Linear Type System for L^p-Metric Sensitivity Analysis

Authors: Victor Sannier and Patrick Baillot

Published in: LIPIcs, Volume 299, 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024)

Abstract

When working in optimisation or privacy protection, one may need to estimate the sensitivity of computer programs, i.e., the maximum multiplicative increase in the distance between two inputs and the corresponding two outputs. In particular, differential privacy is a rigorous and widely used notion of privacy that is closely related to sensitivity. Several type systems for sensitivity and differential privacy based on linear logic have been proposed in the literature, starting with the functional language Fuzz. However, they are either limited to certain metrics (L¹ and L^∞), and thus to the associated privacy mechanisms, or they rely on a complex notion of type contexts that does not interact well with operational semantics. We therefore propose a graded linear type system - inspired by Bunched Fuzz [{w}under et al., 2023] - called Plurimetric Fuzz that handles L^p vector metrics (for 1 ≤ p ≤ +∞), uses standard type contexts, gives reasonable bounds on sensitivity, and has good metatheoretical properties. We also provide a denotational semantics in terms of metric complete partial orders, and translation mappings from and to Fuzz.

Cite as

Victor Sannier and Patrick Baillot. A Linear Type System for L^p-Metric Sensitivity Analysis. In 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 299, pp. 12:1-12:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@InProceedings{sannier_et_al:LIPIcs.FSCD.2024.12,
  author =	{Sannier, Victor and Baillot, Patrick},
  title =	{{A Linear Type System for L^p-Metric Sensitivity Analysis}},
  booktitle =	{9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024)},
  pages =	{12:1--12:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-323-2},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{299},
  editor =	{Rehof, Jakob},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2024.12},
  URN =		{urn:nbn:de:0030-drops-203412},
  doi =		{10.4230/LIPIcs.FSCD.2024.12},
  annote =	{Keywords: type system, linear logic, sensitivity, vector metrics, differential privacy, lambda-calculus, functional programming, denotational semantics}
}

Document

DOI: 10.4230/DagRep.3.12.43

Approaches and Applications of Inductive Programming (Dagstuhl Seminar 13502)

Authors: Sumit Gulwani, Emanuel Kitzelmann, and Ute Schmid

Published in: Dagstuhl Reports, Volume 3, Issue 12 (2014)

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 13502 "Approaches and Applications of Inductive Programming". After a short introduction to inductive programming research, an overview of the talks and the outcomes of discussion groups is given.

Cite as

Sumit Gulwani, Emanuel Kitzelmann, and Ute Schmid. Approaches and Applications of Inductive Programming (Dagstuhl Seminar 13502). In Dagstuhl Reports, Volume 3, Issue 12, pp. 43-66, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)

Copy BibTex To Clipboard

@Article{gulwani_et_al:DagRep.3.12.43,
  author =	{Gulwani, Sumit and Kitzelmann, Emanuel and Schmid, Ute},
  title =	{{Approaches and Applications of Inductive Programming (Dagstuhl Seminar 13502)}},
  pages =	{43--66},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{3},
  number =	{12},
  editor =	{Gulwani, Sumit and Kitzelmann, Emanuel and Schmid, Ute},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.12.43},
  URN =		{urn:nbn:de:0030-drops-45078},
  doi =		{10.4230/DagRep.3.12.43},
  annote =	{Keywords: inductive program synthesis, end-user programming, universal artificial intelligence, constraint programming, probabilistic programming, cognitive mod}
}

Document

DOI: 10.4230/DagRep.2.4.21

Software Synthesis (Dagstuhl Seminar 12152)

Authors: Rastislav Bodík, Sumit Gulwani, and Eran Yahav

Published in: Dagstuhl Reports, Volume 2, Issue 4 (2012)

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 12152 ``Software Synthesis''. During the seminar, several participants presented their current research, ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar are put together in this paper. The rise of multiprocesser computers and of software verification as applied in industry combine to create an opportune moment for software synthesis. To facilitate research in this area, research from several fields of Computer Science presented tutorials on techniques they developed. This lead to (1) the definition of what challenges synthesis has to tackle in the future and (2) insights into how the several fields of synthesis are related. Finally, several groups described their experience with teaching synthesis to graduate and undergraduate students, demonstrating that synthesis is challenging for students but that they can also rise to the challenge and enjoy the field.

Cite as

Rastislav Bodík, Sumit Gulwani, and Eran Yahav. Software Synthesis (Dagstuhl Seminar 12152). In Dagstuhl Reports, Volume 2, Issue 4, pp. 21-38, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@Article{bodik_et_al:DagRep.2.4.21,
  author =	{Bod{\'\i}k, Rastislav and Gulwani, Sumit and Yahav, Eran},
  title =	{{Software Synthesis (Dagstuhl Seminar 12152)}},
  pages =	{21--38},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2012},
  volume =	{2},
  number =	{4},
  editor =	{Bod{\'\i}k, Rastislav and Gulwani, Sumit and Yahav, Eran},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.4.21},
  URN =		{urn:nbn:de:0030-drops-35956},
  doi =		{10.4230/DagRep.2.4.21},
  annote =	{Keywords: Software Synthesis, Verification and Model Checking, Theorem Proving, Program Analysis, Programming by Demonstration, Program Derivation, Compiler Optimization}
}

Refine by Author
2 Gulwani, Sumit
1 Baillot, Patrick
1 Bodík, Rastislav
1 Kitzelmann, Emanuel
1 Sannier, Victor
Show More...

Refine by Classification
1 Security and privacy → Logic and verification
1 Theory of computation → Linear logic
1 Theory of computation → Type theory

Refine by Keyword
1 Compiler Optimization
1 Program Analysis
1 Program Derivation
1 Programming by Demonstration
1 Software Synthesis
Show More...

Refine by Type
3 document

Refine by Publication Year
1 2012
1 2014
1 2024