default search action
Alan Schmitt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt:
Fully Abstract Encodings of $\lambda$-Calculus in HOcore through Abstract Machines. Log. Methods Comput. Sci. 20(3) (2024) - [c50]Sergueï Lenglet, Alan Schmitt:
Leaf-First Zipper Semantics. FORTE 2024: 118-135 - [c49]Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Alan Schmitt:
Optimizing a Non-Deterministic Abstract Machine with Environments. FSCD 2024: 11:1-11:22 - 2023
- [c48]Thomas P. Jensen, Vincent Rebiscoul, Alan Schmitt:
Deriving Abstract Interpreters from Skeletal Semantics. EXPRESS/SOS 2023: 97-113 - 2022
- [c47]Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Alan Schmitt:
Non-Deterministic Abstract Machines. CONCUR 2022: 7:1-7:24 - [c46]Guillaume Ambal, Sergueï Lenglet, Alan Schmitt:
Certified abstract machines for skeletal semantics. CPP 2022: 55-67 - [c45]Louis Noizet, Alan Schmitt:
Semantics in Skel and Necro. ICTCS 2022: 99-115 - [c44]Adam Khayam
, Louis Noizet, Alan Schmitt:
A Faithful Description of ECMAScript Algorithms. PPDP 2022: 8:1-8:14 - [c43]Guillaume Ambal, Sergueï Lenglet, Alan Schmitt, Camille Noûs:
Certified Derivation of Small-Step From Big-Step Skeletal Semantics. PPDP 2022: 11:1-11:48 - [i4]Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt:
Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines. CoRR abs/2205.06665 (2022) - 2021
- [j9]Guillaume Ambal, Sergueï Lenglet, Alan Schmitt:
HOπ in Coq. J. Autom. Reason. 65(1): 75-124 (2021)
2010 – 2019
- 2019
- [j8]Martin Bodin
Skeletal semantics and their interpretations. Proc. ACM Program. Lang. 3(POPL): 44:1-44:31 (2019) - 2018
- [c42]Sergueï Lenglet, Alan Schmitt:
HOπ in Coq. CPP 2018: 252-265 - [c41]Arthur Charguéraud, Alan Schmitt, Thomas Wood
JSExplain: A Double Debugger for JavaScript. WWW (Companion Volume) 2018: 691-699 - [i3]Martin Bodin, Philippa Gardner, Thomas P. Jensen, Alan Schmitt:
Skeletal Semantics and their Interpretations. CoRR abs/1809.09749 (2018) - 2017
- [c40]Gurvan Cabon, Alan Schmitt:
Annotated Multisemantics To Prove Non-Interference Analyses. PLAS@CCS 2017: 49-62 - [c39]Malgorzata Biernacka
Fully abstract encodings of λ-calculus in HOcore through abstract machines. LICS 2017: 1-12 - 2015
- [j7]J. Nathan Foster, Michael B. Greenwald, Jonathan T. Moore, Benjamin C. Pierce, Alan Schmitt:
POPL 2005: Combinators for Bi-Directional Tree Transformations: Linguistic Approach to the View Update Problem. ACM SIGPLAN Notices 50(8s): 49-62 (2015) - [j6]Pierre Genevès, Nabil Layaïda, Alan Schmitt, Nils Gesbert:
Efficiently Deciding μ-Calculus with Converse over Finite Trees. ACM Trans. Comput. Log. 16(2): 16:1-16:41 (2015) - [c38]Sergueï Lenglet, Alan Schmitt:
Howe's Method for Contextual Semantics. CONCUR 2015: 212-225 - [c37]Martin Bodin
Certified Abstract Interpretation with Pretty-Big-Step Semantics. CPP 2015: 29-40 - [c36]Pierre Genevès, Alan Schmitt:
Expressive Logical Combinators for Free. IJCAI 2015: 311-317 - [c35]Petar Maksimovic
HOCore in Coq. ITP 2015: 278-293 - [c34]José Fragoso Santos
Hybrid Typing of Secure Information Flow in a JavaScript-Like Language. TGC 2015: 63-78 - 2014
- [c33]Martin Bodin, Thomas P. Jensen, Alan Schmitt:
Pretty-big-step-semantics-based Certified Abstract Interpretation. JFLA 2014: 109-130 - [c32]Damien Pous, Alan Schmitt:
De la KAM avec un Processus d'Ordre Supe'rieur. JFLA 2014: 149-158 - [c31]Martin Bodin
A trusted mechanised JavaScript specification. POPL 2014: 87-100 - 2013
- [c30]Ivan Lanese, Michael Lienhardt, Claudio Antares Mezzina
Concurrent Flexible Reversibility. ESOP 2013: 370-390 - [c29]Martin Bodin
Pretty-big-step-semantics-based Certified Abstract Interpretation (Preliminary version). Festschrift for Dave Schmidt 2013: 360-383 - [e2]Todd J. Green, Alan Schmitt:
Proceedings of the 14th International Symposium on Database Programming Languages (DBPL 2013), August 30, 2013, Riva del Garda, Trento, Italy. 2013 [contents] - 2011
- [b1]Alan Schmitt:
Static Analyses for Manipulations of Hierarchically Structured Data. (Analyses Statiques pour Manipulations de Données Structurées Hiérarchiquement). Grenoble Alpes University, France, 2011 - [j5]Ivan Lanese
On the expressiveness and decidability of higher-order process calculi. Inf. Comput. 209(2): 198-226 (2011) - [j4]Sergueï Lenglet, Alan Schmitt, Jean-Bernard Stefani:
Characterizing contextual equivalence in calculi with passivation. Inf. Comput. 209(11): 1390-1433 (2011) - [c28]Ivan Lanese
Controlling Reversibility in Higher-Order Pi. CONCUR 2011: 297-311 - [c27]Everardo Bárcenas
Query Reasoning on Trees with Types, Interleaving, and Counting. IJCAI 2011: 718-723 - 2010
- [c26]Ivan Lanese
On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi. ICALP (2) 2010: 442-453 - [i2]Everardo Bárcenas, Pierre Genevès, Nabil Layaïda, Alan Schmitt:
A Tree Logic with Graded Paths and Nominals. CoRR abs/1005.5623 (2010) - [i1]Everardo Bárcenas, Pierre Genevès, Nabil Layaïda, Alan Schmitt:
On the Count of Trees. CoRR abs/1008.5073 (2010)
2000 – 2009
- 2009
- [c25]Sergueï Lenglet, Alan Schmitt, Jean-Bernard Stefani:
Howe's Method for Calculi with Passivation. CONCUR 2009: 448-462 - [c24]Michael Lienhardt, Claudio Antares Mezzina
Typing Component-Based Communication Systems. FMOODS/FORTE 2009: 167-181 - [c23]Sergueï Lenglet, Alan Schmitt, Jean-Bernard Stefani:
Normal Bisimulations in Calculi with Passivation. FoSSaCS 2009: 257-271 - [c22]Ivan Lanese, Jorge A. Pérez, Davide Sangiorgi, Alan Schmitt:
On the Expressiveness of Polyadicity in Higher-Order Process Calculi. ICTCS 2009: 143-149 - [e1]Alan Schmitt:
JFLA 2009, Vingtièmes Journées Francophones des Langages Applicatifs, Saint Quentin sur Isère, France, January 31 - February 3, 2009. Proceedings. Studia Informatica Universalis 7.2, 2009, ISBN 978-2-7056-6917-1 [contents] - 2008
- [c21]Michael Lienhardt, Alan Schmitt, Jean-Bernard Stefani:
Typing communicating component assemblages. GPCE 2008: 125-136 - [c20]Ivan Lanese
On the Expressiveness and Decidability of Higher-Order Process Calculi. LICS 2008: 145-155 - [c19]Aaron Bohannon, J. Nathan Foster, Benjamin C. Pierce, Alexandre Pilkiewicz, Alan Schmitt:
Boomerang: resourceful lenses for string data. POPL 2008: 407-419 - 2007
- [j3]J. Nathan Foster, Michael B. Greenwald, Christian Kirkegaard, Benjamin C. Pierce, Alan Schmitt:
Exploiting schemas in data synchronization. J. Comput. Syst. Sci. 73(4): 669-689 (2007) - [j2]J. Nathan Foster, Michael B. Greenwald, Jonathan T. Moore, Benjamin C. Pierce, Alan Schmitt:
Combinators for bidirectional tree transformations: A linguistic approach to the view-update problem. ACM Trans. Program. Lang. Syst. 29(3): 17 (2007) - [c18]Michael Lienhardt, Alan Schmitt, Jean-Bernard Stefani:
Oz/K: a kernel language for component-based open programming. GPCE 2007: 43-52 - [c17]Pierre Genevès, Nabil Layaïda, Alan Schmitt:
XPath Typing Using a Modal Logic with Converse for Finite Trees. PLAN-X 2007: 61-72 - [c16]J. Nathan Foster, Benjamin C. Pierce, Alan Schmitt:
A Logic Your Typechecker Can Count On: Unordered Tree Types in Practice. PLAN-X 2007: 80-90 - [c15]Pierre Genevès, Nabil Layaïda, Alan Schmitt:
Efficient static analysis of XML paths and types. PLDI 2007: 342-351 - 2006
- [j1]Philippe Bidinger, Matthieu Leclercq, Vivien Quéma, Alan Schmitt, Jean-Bernard Stefani:
Dream types: a domain specific type system for component-based message-oriented middleware. ACM SIGSOFT Softw. Eng. Notes 31(2) (2006) - [c14]Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pierce, Alan Schmitt:
XTATIC. PLAN-X 2006: 88 - [c13]Michael B. Greenwald, Sanjeev Khanna, Keshav Kunal, Benjamin C. Pierce, Alan Schmitt:
Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data. DISC 2006: 269-283 - 2005
- [c12]Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pierce, Alan Schmitt:
XML Goes Native: Run-Time Representations for Xtatic. CC 2005: 43-58 - [c11]J. Nathan Foster, Michael B. Greenwald, Christian Kirkegaard, Benjamin C. Pierce, Alan Schmitt:
Exploiting Schemas in Data Synchronization. DBPL 2005: 42-57 - [c10]Philippe Bidinger, Alan Schmitt, Jean-Bernard Stefani:
An Abstract Machine for the Kell Calculus. FMOODS 2005: 31-46 - [c9]Daniel Hirschkoff, Tom Hirschowitz, Damien Pous
Component-Oriented Programming with Sharing: Containment is Not Ownership. GPCE 2005: 389-404 - [c8]J. Nathan Foster, Michael B. Greenwald, Jonathan T. Moore, Benjamin C. Pierce, Alan Schmitt:
Combinators for bi-directional tree transformations: a linguistic approach to the view update problem. POPL 2005: 233-246 - [c7]Philippe Bidinger, Matthieu Leclercq, Vivien Quéma, Alan Schmitt, Jean-Bernard Stefani:
Dream types: a domain specific type system for component-based message-oriented middleware. SAVCBS@ESEC/FSE 2005: 2 - 2004
- [c6]Alan Schmitt, Jean-Bernard Stefani:
The Kell Calculus: A Family of Higher-Order Distributed Process Calculi. Global Computing 2004: 146-178 - [c5]Sara Bouchenak, Fabienne Boyer, Emmanuel Cecchet, Sébastien Jean, Alan Schmitt, Jean-Bernard Stefani:
A component-based approach to distributed system management: a use case with self-manageable J2EE clusters. ACM SIGOPS European Workshop 2004: 26 - 2003
- [c4]Alan Schmitt, Jean-Bernard Stefani:
The m-calculus: a higher-order distributed process calculus. POPL 2003: 50-61 - 2002
- [c3]Cédric Fournet, Fabrice Le Fessant, Luc Maranget, Alan Schmitt:
JoCaml: A Language for Concurrent Distributed and Mobile Programming. Advanced Functional Programming 2002: 129-158 - [c2]Alan Schmitt:
Safe Dynamic Binding in the Join Calculus. IFIP TCS 2002: 563-575 - 2000
- [c1]Cédric Fournet, Jean-Jacques Lévy, Alan Schmitt:
An Asynchronous, Distributed Implementation of Mobile Ambients. IFIP TCS 2000: 348-364
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-19 18:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: