Alan Schmitt

According to our database1, Alan Schmitt authored at least 50 papers between 2000 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
HOπ in Coq.
J. Autom. Reason., 2021

2019
Skeletal semantics and their interpretations.
Proc. ACM Program. Lang., 2019

2018
JSExplain: A Double Debugger for JavaScript.
Proceedings of the Companion of the The Web Conference 2018 on The Web Conference 2018, 2018

HOπ in Coq.
Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2018

2017
Fully abstract encodings of λ-calculus in HOcore through abstract machines.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Annotated Multisemantics To Prove Non-Interference Analyses.
Proceedings of the 2017 Workshop on Programming Languages and Analysis for Security, 2017

2015
Efficiently Deciding μ-Calculus with Converse over Finite Trees.
ACM Trans. Comput. Log., 2015

Hybrid Typing of Secure Information Flow in a JavaScript-Like Language.
Proceedings of the Trustworthy Global Computing - 10th International Symposium, 2015

HOCore in Coq.
Proceedings of the Interactive Theorem Proving - 6th International Conference, 2015

Expressive Logical Combinators for Free.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Certified Abstract Interpretation with Pretty-Big-Step Semantics.
Proceedings of the 2015 Conference on Certified Programs and Proofs, 2015

Howe's Method for Contextual Semantics.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
A trusted mechanised JavaScript specification.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

De la KAM avec un Processus d'Ordre Supe'rieur.
Proceedings of the 25. Journées francophones des langages applicatifs, 2014

Pretty-big-step-semantics-based Certified Abstract Interpretation.
Proceedings of the 25. Journées francophones des langages applicatifs, 2014

2013
Pretty-big-step-semantics-based Certified Abstract Interpretation (Preliminary version).
Proceedings of the Semantics, 2013

Concurrent Flexible Reversibility.
Proceedings of the Programming Languages and Systems, 2013

2011
Characterizing contextual equivalence in calculi with passivation.
Inf. Comput., 2011

On the expressiveness and decidability of higher-order process calculi.
Inf. Comput., 2011

Query Reasoning on Trees with Types, Interleaving, and Counting.
Proceedings of the IJCAI 2011, 2011

Controlling Reversibility in Higher-Order Pi.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Static Analyses for Manipulations of Hierarchically Structured Data. (Analyses Statiques pour Manipulations de Données Structurées Hiérarchiquement).
, 2011

2010
On the Count of Trees
CoRR, 2010

A Tree Logic with Graded Paths and Nominals
CoRR, 2010

On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
On the Expressiveness of Polyadicity in Higher-Order Process Calculi.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

Normal Bisimulations in Calculi with Passivation.
Proceedings of the Foundations of Software Science and Computational Structures, 2009

Typing Component-Based Communication Systems.
Proceedings of the Formal Techniques for Distributed Systems, 2009

Howe's Method for Calculi with Passivation.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
Boomerang: resourceful lenses for string data.
Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2008

Typing communicating component assemblages.
Proceedings of the Generative Programming and Component Engineering, 2008

2007
Combinators for bidirectional tree transformations: A linguistic approach to the view-update problem.
ACM Trans. Program. Lang. Syst., 2007

Exploiting schemas in data synchronization.
J. Comput. Syst. Sci., 2007

Efficient static analysis of XML paths and types.
Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, 2007

XPath Typing Using a Modal Logic with Converse for Finite Trees.
Proceedings of the PLAN-X 2007, 2007

A Logic Your Typechecker Can Count On: Unordered Tree Types in Practice.
Proceedings of the PLAN-X 2007, 2007

Oz/K: a kernel language for component-based open programming.
Proceedings of the Generative Programming and Component Engineering, 2007

2006
Dream types: a domain specific type system for component-based message-oriented middleware.
ACM SIGSOFT Softw. Eng. Notes, 2006

Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

XTATIC.
Proceedings of the PLAN-X 2006 Informal Proceedings, 2006

2005
Combinators for bi-directional tree transformations: a linguistic approach to the view update problem.
Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2005

Component-Oriented Programming with Sharing: Containment is Not Ownership.
Proceedings of the Generative Programming and Component Engineering, 2005

An Abstract Machine for the Kell Calculus.
Proceedings of the Formal Methods for Open Object-Based Distributed Systems, 2005

XML Goes Native: Run-Time Representations for Xtatic.
Proceedings of the Compiler Construction, 14th International Conference, 2005

2004
A component-based approach to distributed system management: a use case with self-manageable J2EE clusters.
Proceedings of the 11st ACM SIGOPS European Workshop, 2004

The Kell Calculus: A Family of Higher-Order Distributed Process Calculi.
Proceedings of the Global Computing, IST/FET International Workshop, 2004

2003
The m-calculus: a higher-order distributed process calculus.
Proceedings of the Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2003

2002
Safe Dynamic Binding in the Join Calculus.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

JoCaml: A Language for Concurrent Distributed and Mobile Programming.
Proceedings of the Advanced Functional Programming, 2002

2000
An Asynchronous, Distributed Implementation of Mobile Ambients.
Proceedings of the Theoretical Computer Science, 2000


  Loading...