6 Search Results for "Siméon, Jérôme"

Document
DOI: 10.4230/LIPIcs.ITCS.2026.18
Interactive Proofs for Distribution Testing with Conditional Oracles

Authors: Ari Biswas, Mark Bun, Clément L. Canonne, and Satchit Sivakumar

Published in: LIPIcs, Volume 362, 17th Innovations in Theoretical Computer Science Conference (ITCS 2026)

Abstract
We revisit the framework of interactive proofs for distribution testing, first introduced by Chiesa and Gur (ITCS 2018), which has recently experienced a surge in interest, accompanied by notable progress (e.g., Herman and Rothblum, STOC 2022, FOCS 2023; Herman, RANDOM 2024). In this model, a data-poor verifier determines whether a probability distribution has a property of interest by interacting with an all-powerful, data-rich but untrusted prover bent on convincing them that it has the property. While prior work gave sample-, time-, and communication-efficient protocols for testing and estimating a range of distribution properties, they all suffer from an inherent issue: for most interesting properties of distributions over a domain of size N, the verifier must draw at least Ω(√N) samples of its own. While sublinear in N, this is still prohibitive for large domains encountered in practice. In this work, we circumvent this limitation by augmenting the verifier with the ability to perform an exponentially smaller number of more powerful (but reasonable) pairwise conditional queries, effectively enabling them to perform "local comparison checks" of the prover’s claims. We systematically investigate the landscape of interactive proofs in this new setting, giving poly-logarithmic query and sample protocols for (tolerantly) testing all label-invariant properties, thus demonstrating exponential savings without compromising on communication, for this large and fundamental class of testing tasks.
Cite as

Ari Biswas, Mark Bun, Clément L. Canonne, and Satchit Sivakumar. Interactive Proofs for Distribution Testing with Conditional Oracles. In 17th Innovations in Theoretical Computer Science Conference (ITCS 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 362, pp. 18:1-18:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{biswas_et_al:LIPIcs.ITCS.2026.18,
  author =	{Biswas, Ari and Bun, Mark and Canonne, Cl\'{e}ment L. and Sivakumar, Satchit},
  title =	{{Interactive Proofs for Distribution Testing with Conditional Oracles}},
  booktitle =	{17th Innovations in Theoretical Computer Science Conference (ITCS 2026)},
  pages =	{18:1--18:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-410-9},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{362},
  editor =	{Saraf, Shubhangi},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.18},
  URN =		{urn:nbn:de:0030-drops-253059},
  doi =		{10.4230/LIPIcs.ITCS.2026.18},
  annote =	{Keywords: Distribution Testing, Interactive Proofs}
}
Document
DOI: 10.4230/LIPIcs.SNAPL.2017.6
I Can Parse You: Grammars for Dialogs

Authors: Martin Hirzel, Louis Mandel, Avraham Shinnar, Jerome Simeon, and Mandana Vaziri

Published in: LIPIcs, Volume 71, 2nd Summit on Advances in Programming Languages (SNAPL 2017)

Abstract
Humans and computers increasingly converse via natural language. Those conversations are moving from today's simple question answering and command-and-control to more complex dialogs. Developers must specify those dialogs. This paper explores how to assist developers in this specification. We map out the staggering variety of applications for human-computer dialogs and distill it into a catalog of flow patterns. Based on that, we articulate the requirements for dialog programming models and offer our vision for satisfying these requirements using grammars. If our approach catches on, computers will soon parse you to better assist you in your daily life.
Cite as

Martin Hirzel, Louis Mandel, Avraham Shinnar, Jerome Simeon, and Mandana Vaziri. I Can Parse You: Grammars for Dialogs. In 2nd Summit on Advances in Programming Languages (SNAPL 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 71, pp. 6:1-6:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@InProceedings{hirzel_et_al:LIPIcs.SNAPL.2017.6,
  author =	{Hirzel, Martin and Mandel, Louis and Shinnar, Avraham and Simeon, Jerome and Vaziri, Mandana},
  title =	{{I Can Parse You: Grammars for Dialogs}},
  booktitle =	{2nd Summit on Advances in Programming Languages (SNAPL 2017)},
  pages =	{6:1--6:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-032-3},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{71},
  editor =	{Lerner, Benjamin S. and Bod{\'\i}k, Rastislav and Krishnamurthi, Shriram},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SNAPL.2017.6},
  URN =		{urn:nbn:de:0030-drops-71180},
  doi =		{10.4230/LIPIcs.SNAPL.2017.6},
  annote =	{Keywords: Bots, virtual agents, dialog managers, domain-specific languages}
}
Document
DOI: 10.4230/DARTS.1.1.8
A Pattern Calculus for Rule Languages: Expressiveness, Compilation, and Mechanization (Artifact)

Authors: Avraham Shinnar, Jérôme Siméon, and Martin Hirzel

Published in: DARTS, Volume 1, Issue 1, Special Issue of the 29th European Conference on Object-Oriented Programming (ECOOP 2015)

Abstract
This artifact contains the accompanying code for the ECOOP 2015 paper: "A Pattern Calculus for Rule Languages: Expressiveness, Compilation, and Mechanization". It contains source files for a full mechanization of the three languages presented in the paper: CAMP (Calculus for Aggregating Matching Patterns), NRA (Nested Relational Algebra) and NNRC (Named Nested Relational Calculus). Translations between all three languages and their attendant proofs of correctness are included. Additionally, a mechanization of a type system for the main languages is provided, along with bidirectional proofs of type preservation and proofs of the time complexity of the various compilers.
Cite as

Avraham Shinnar, Jérôme Siméon, and Martin Hirzel. A Pattern Calculus for Rule Languages: Expressiveness, Compilation, and Mechanization (Artifact). In Special Issue of the 29th European Conference on Object-Oriented Programming (ECOOP 2015). Dagstuhl Artifacts Series (DARTS), Volume 1, Issue 1, pp. 8:1-8:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@Article{shinnar_et_al:DARTS.1.1.8,
  author =	{Shinnar, Avraham and Sim\'{e}on, J\'{e}r\^{o}me and Hirzel, Martin},
  title =	{{A Pattern Calculus for Rule Languages: Expressiveness, Compilation, and Mechanization (Artifact)}},
  pages =	{8:1--8:2},
  journal =	{Dagstuhl Artifacts Series},
  ISSN =	{2509-8195},
  year =	{2015},
  volume =	{1},
  number =	{1},
  editor =	{Shinnar, Avraham and Sim\'{e}on, J\'{e}r\^{o}me and Hirzel, Martin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DARTS.1.1.8},
  URN =		{urn:nbn:de:0030-drops-55179},
  doi =		{10.4230/DARTS.1.1.8},
  annote =	{Keywords: Rules, Pattern Matching, Aggregation, Nested Queries, Mechanization}
}
Document
DOI: 10.4230/LIPIcs.ECOOP.2015.542
A Pattern Calculus for Rule Languages: Expressiveness, Compilation, and Mechanization

Authors: Avraham Shinnar, Jérôme Siméon, and Martin Hirzel

Published in: LIPIcs, Volume 37, 29th European Conference on Object-Oriented Programming (ECOOP 2015)

Abstract
This paper introduces a core calculus for pattern-matching in production rule languages: the Calculus for Aggregating Matching Patterns (CAMP). CAMP is expressive enough to capture modern rule languages such as JRules, including extensions for aggregation. We show how CAMP can be compiled into a nested-relational algebra (NRA), with only minimal extension. This paves the way for applying relational techniques to running rules over large stores. Furthermore, we show that NRA can also be compiled back to CAMP, using named nested-relational calculus (NNRC) as an intermediate step. We mechanize proofs of correctness, program size preservation, and type preservation of the translations using modern theorem-proving techniques. A corollary of the type preservation is that polymorphic type inference for both CAMP and NRA is NP-complete. CAMP and its correspondence to NRA provide the foundations for efficient implementations of rules languages using databases technologies.
Cite as

Avraham Shinnar, Jérôme Siméon, and Martin Hirzel. A Pattern Calculus for Rule Languages: Expressiveness, Compilation, and Mechanization. In 29th European Conference on Object-Oriented Programming (ECOOP 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 37, pp. 542-567, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@InProceedings{shinnar_et_al:LIPIcs.ECOOP.2015.542,
  author =	{Shinnar, Avraham and Sim\'{e}on, J\'{e}r\^{o}me and Hirzel, Martin},
  title =	{{A Pattern Calculus for Rule Languages: Expressiveness, Compilation, and Mechanization}},
  booktitle =	{29th European Conference on Object-Oriented Programming (ECOOP 2015)},
  pages =	{542--567},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-86-6},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{37},
  editor =	{Boyland, John Tang},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2015.542},
  URN =		{urn:nbn:de:0030-drops-52374},
  doi =		{10.4230/LIPIcs.ECOOP.2015.542},
  annote =	{Keywords: Rules, Pattern Matching, Aggregation, Nested Queries, Mechanization}
}
Document
DOI: 10.4230/DagSemProc.06472.1
06472 Abstracts Collection – XQuery Implementation Paradigms

Authors: Peter A. Boncz, Torsten Grust, Jérôme Siméon, and Maurice van Keulen

Published in: Dagstuhl Seminar Proceedings, Volume 6472, XQuery Implementation Paradigms (2007)

Abstract
From 19.11.2006 to 22.11.2006, the Dagstuhl Seminar 06472 ``XQuery Implementation Paradigms'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Peter A. Boncz, Torsten Grust, Jérôme Siméon, and Maurice van Keulen. 06472 Abstracts Collection – XQuery Implementation Paradigms. In XQuery Implementation Paradigms. Dagstuhl Seminar Proceedings, Volume 6472, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{boncz_et_al:DagSemProc.06472.1,
  author =	{Boncz, Peter A. and Grust, Torsten and Sim\'{e}on, J\'{e}r\^{o}me and van Keulen, Maurice},
  title =	{{06472 Abstracts Collection – XQuery Implementation Paradigms}},
  booktitle =	{XQuery Implementation Paradigms},
  pages =	{1--22},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6472},
  editor =	{Peter A. Boncz and Torsten Grust and J\'{e}r\^{o}me Sim\'{e}on and Maurice van Keulen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06472.1},
  URN =		{urn:nbn:de:0030-drops-8933},
  doi =		{10.4230/DagSemProc.06472.1},
  annote =	{Keywords: XQuery, XPath, XML, XQuery Benchmarking, XQuery Optimization, XQuery Interoperability, XQuery Hard Nut, Compilation, Benchmarking, XMark, Recursion, Database System, Functional Programming Language, Transaction Management, Distributed Query Processing}
}
Document
DOI: 10.4230/DagSemProc.06472.2
06472 Executive Summary – XQuery Implementation Paradigms

Authors: Peter A. Boncz, Torsten Grust, Jérôme Siméon, and Maurice van Keulen

Published in: Dagstuhl Seminar Proceedings, Volume 6472, XQuery Implementation Paradigms (2007)

Abstract
Only a couple of weeks after the participants of seminar No. 06472 met in Dagstuhl, the W3C published the Final Recommendation documents that fix the XQuery 1.0 syntax, data model, formal semantics, built-in function library and the interaction with the XML Schema Recommendations (see W3C's XQuery web site at http://www.w3.org/XML/Query/). With the language's standardization nearing its end and now finally in place, the many efforts to construct correct, complete, and efficient implementations of XQuery finally got rid of the hindering "moving target'' syndrome. This Dagstuhl seminar on the different XQuery implementation paradigms that have emerged in the recent past, thus was as timely as it could have possibly been.
Cite as

Peter A. Boncz, Torsten Grust, Jérôme Siméon, and Maurice van Keulen. 06472 Executive Summary – XQuery Implementation Paradigms. In XQuery Implementation Paradigms. Dagstuhl Seminar Proceedings, Volume 6472, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{boncz_et_al:DagSemProc.06472.2,
  author =	{Boncz, Peter A. and Grust, Torsten and Sim\'{e}on, J\'{e}r\^{o}me and van Keulen, Maurice},
  title =	{{06472 Executive Summary – XQuery Implementation Paradigms}},
  booktitle =	{XQuery Implementation Paradigms},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6472},
  editor =	{Peter A. Boncz and Torsten Grust and J\'{e}r\^{o}me Sim\'{e}on and Maurice van Keulen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06472.2},
  URN =		{urn:nbn:de:0030-drops-10220},
  doi =		{10.4230/DagSemProc.06472.2},
  annote =	{Keywords: XQuery, XML, Database, Compiler, Functional Programming, Transactions}
}
  • Refine by Type
  • 6 Document/PDF
  • 1 Document/HTML

  • Refine by Publication Year
  • 1 2026
  • 1 2017
  • 2 2015
  • 2 2007

  • Refine by Author
  • 4 Siméon, Jérôme
  • 3 Hirzel, Martin
  • 3 Shinnar, Avraham
  • 2 Boncz, Peter A.
  • 2 Grust, Torsten
  • Show More...

  • Refine by Series/Journal
  • 3 LIPIcs
  • 1 DARTS
  • 2 DagSemProc

  • Refine by Classification
  • 1 Theory of computation → Interactive computation

  • Refine by Keyword
  • 2 Aggregation
  • 2 Mechanization
  • 2 Nested Queries
  • 2 Pattern Matching
  • 2 Rules
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact