alan-journal.bib

@comment{{This file has been generated by bib2bib 1.98}}
@comment{{Command line: bib2bib -ob alan-journal.bib -oc alan-journal.keys -c '(Alan:"1") & ($type="ARTICLE")' --rename journaltitle journal alan.bib}}
@article{Foster2007Exploiting-Schemas-i,
  alan = {1},
  author = {J. Nathan Foster and Michael B. Greenwald and Christian Kirkegaard and Benjamin C. Pierce and Alan Schmitt},
  date-added = {2007-07-23 14:18:06 +0200},
  date-modified = {2010-06-07 16:33:57 +0200},
  doi = {http://dx.doi.org/10.1016/j.jcss.2006.10.024},
  full = {http://www.cis.upenn.edu/~bcpierce/papers/sync-jcss.pdf},
  journal = {Journal of Computer and System Sciences},
  keywords = {Harmony},
  month = jun,
  note = {Extended abstract in {\em Database Programming Languages (DBPL)} 2005},
  number = {4},
  pages = {669--689},
  read = {1},
  short = {http://www.cis.upenn.edu/~bcpierce/papers/sync-dbpl.pdf},
  slides = {http://www.cis.upenn.edu/~jnfoster/papers/schema-sync-slides.pdf},
  title = {Exploiting Schemas in Data Synchronization},
  tr = {http://www.cis.upenn.edu/~bcpierce/papers/sync-tr.pdf},
  volume = {73},
  year = 2007,
  bdsk-file-1 = {YnBsaXN0MDDUAQIDBAUGJCVYJHZlcnNpb25YJG9iamVjdHNZJGFyY2hpdmVyVCR0b3ASAAGGoKgHCBMUFRYaIVUkbnVsbNMJCgsMDxJXTlMua2V5c1pOUy5vYmplY3RzViRjbGFzc6INDoACgAOiEBGABIAFgAdccmVsYXRpdmVQYXRoWWFsaWFzRGF0YV8QPi4uLy4uL0RvY3VtZW50cy9CaWJEZXNrRG9jcy9Gb3N0ZXIyMDA3RXhwbG9pdGluZy1TY2hlbWFzLWkucGRm0hcLGBlXTlMuZGF0YU8RAfAAAAAAAfAAAgAADE1hY2ludG9zaCBIRAAAAAAAAAAAAAAAAAAAAM/URuZIKwAAAA/nmR9Gb3N0ZXIyMDA3RXhwbG9pdGluZy0jRkU3RkEucGRmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD+f6wsqDMgAAAAAAAAAAAAIAAwAACSAAAAAAAAAAAAAAAAAAAAALQmliRGVza0RvY3MAABAACAAAz9QqxgAAABEACAAAwspnEgAAAAEAEAAP55kAD7KIAAmg9gACZvkAAgBVTWFjaW50b3NoIEhEOlVzZXJzOgBzY2htaXR0YToARG9jdW1lbnRzOgBCaWJEZXNrRG9jczoARm9zdGVyMjAwN0V4cGxvaXRpbmctI0ZFN0ZBLnBkZgAADgBGACIARgBvAHMAdABlAHIAMgAwADAANwBFAHgAcABsAG8AaQB0AGkAbgBnAC0AUwBjAGgAZQBtAGEAcwAtAGkALgBwAGQAZgAPABoADABNAGEAYwBpAG4AdABvAHMAaAAgAEgARAASAEdVc2Vycy9zY2htaXR0YS9Eb2N1bWVudHMvQmliRGVza0RvY3MvRm9zdGVyMjAwN0V4cGxvaXRpbmctU2NoZW1hcy1pLnBkZgAAEwABLwAAFQACAA///wAAgAbSGxwdHlokY2xhc3NuYW1lWCRjbGFzc2VzXU5TTXV0YWJsZURhdGGjHR8gVk5TRGF0YVhOU09iamVjdNIbHCIjXE5TRGljdGlvbmFyeaIiIF8QD05TS2V5ZWRBcmNoaXZlctEmJ1Ryb290gAEACAARABoAIwAtADIANwBAAEYATQBVAGAAZwBqAGwAbgBxAHMAdQB3AIQAjgDPANQA3ALQAtIC1wLiAusC+QL9AwQDDQMSAx8DIgM0AzcDPAAAAAAAAAIBAAAAAAAAACgAAAAAAAAAAAAAAAAAAAM+}
}
@article{FosterGreenwaldMoorePierceSchmitt2007,
  address = {New York, NY, USA},
  alan = 1,
  author = {J. Nathan Foster and Michael B. Greenwald and Jonathan T.
                  Moore and Benjamin C. Pierce and Alan Schmitt},
  full = {http://www.cis.upenn.edu/~bcpierce/papers/lenses-toplas-final.pdf},
  fullappendix = {http://www.cis.upenn.edu/~bcpierce/papers/lenses-toplas-electronic-appendix.pdf},
  journal = {ACM Transactions on Programming Languages and Systems},
  month = may,
  note = {Preliminary version presented at the {\em Workshop on
                  Programming Language Technologies for XML (PLAN-X)}, 2004;
                  extended abstract presented at {\em Principles of
                  Programming Languages (POPL)}, 2005 (\textbf{Most
                  Influential POPL Paper Award, 2015}).},
  number = 3,
  pages = 17,
  publisher = {ACM Press},
  short = {http://www.cis.upenn.edu/~bcpierce/papers/newlenses-popl.pdf},
  slides = {http://www.cis.upenn.edu/~bcpierce/papers/newlenses-popl-slides.pdf},
  title = {Combinators for bidirectional tree transformations:
                  A linguistic approach to the view-update problem},
  volume = 29,
  year = 2007
}
@article{GenevesGesbertLayaidaSchmitt-TOCL-2015,
  publisher = {Association for Computing Machinery},
  doi = {10.1145/2724712},
  number = {2},
  volume = {16},
  alan = {1},
  author = {Genev{\`e}s, Pierre and Gesbert, Nils and Laya{\"\i}da, Nabil and Schmitt, Alan},
  hal = {https://hal.inria.fr/hal-00868722},
  journal = {ACM Transactions on Computational Logic},
  title = {Efficiently Deciding $\mu$-calculus with Converse over Finite Trees},
  year = {2015}
}
@article{Lanese2011On-the-Expressivenes,
  alan = {1},
  author = {Lanese, Ivan and Pérez, Jorge A and Sangiorgi, Davide and Schmitt, Alan},
  full = {http://www.irisa.fr/celtique/aschmitt/papers/Lanese2011On-the-Expressivenes.pdf},
  journal = {Information and Computation},
  month = feb,
  note = {Extended abstract presented at \emph{Logic in Computer Science (LICS)}, 2008. Coq formalization available at \url{http://www.irisa.fr/celtique/aschmitt/research/hocore/}},
  number = {2},
  pages = {198--226},
  read = {1},
  title = {On the Expressiveness and Decidability of Higher-Order Process Calculi},
  volume = {209},
  year = {2011}
}
@article{Lenglet2011Characterizing-Conte,
  alan = {1},
  author = {Lenglet, Sergue{\"\i} and Schmitt, Alan and Stefani, Jean-Bernard},
  date-added = {2011-10-13 10:07:33 +0000},
  date-modified = {2013-10-16 13:47:12 +0000},
  doi = {http://dx.doi.org/10.1016/j.ic.2011.08.002},
  full = {http://www.irisa.fr/celtique/aschmitt/papers/Lenglet2011Characterizing-Conte.pdf},
  journal = {Information and Computation},
  month = nov,
  note = {Extended abstract presented at \emph{FOSSACS}, 2009, and \emph{CONCUR}, 2009.},
  number = {11},
  pages = {1390--1433},
  read = {1},
  title = {Characterizing Contextual Equivalence in Calculi with Passivation},
  volume = {209},
  year = {2011},
  abstract = {We study the problem of characterizing contextual equivalence in higher-order languages with passivation. To overcome the difficulties arising in the proof of congruence of candidate bisimilarities, we introduce a new form of labeled transition semantics together with its associated notion of bisimulation, which we call complementary semantics. Complementary semantics allows to apply the well-known Howeʼs method for proving the congruence of bisimilarities in a higher-order setting, even in the presence of an early form of bisimulation. We use complementary semantics to provide a coinductive characterization of contextual equivalence in the HOπP calculus, an extension of the higher-order π-calculus with passivation, obtaining the first result of this kind. We then study the problem of defining a more effective variant of bisimilarity that still characterizes contextual equivalence, along the lines of Sangiorgiʼs notion of normal bisimilarity. We provide partial results on this difficult problem: we show that a large class of test processes cannot be used to derive a normal bisimilarity in HOπP, but we show that a form of normal bisimilarity can be defined for HOπP without restriction.

},
  bdsk-file-1 = {YnBsaXN0MDDUAQIDBAUGJCVYJHZlcnNpb25YJG9iamVjdHNZJGFyY2hpdmVyVCR0b3ASAAGGoKgHCBMUFRYaIVUkbnVsbNMJCgsMDxJXTlMua2V5c1pOUy5vYmplY3RzViRjbGFzc6INDoACgAOiEBGABIAFgAdccmVsYXRpdmVQYXRoWWFsaWFzRGF0YV8QPy4uLy4uL0RvY3VtZW50cy9CaWJEZXNrRG9jcy9MZW5nbGV0MjAxMUNoYXJhY3Rlcml6aW5nLUNvbnRlLnBkZtIXCxgZV05TLmRhdGFPEQHyAAAAAAHyAAIAAAxNYWNpbnRvc2ggSEQAAAAAAAAAAAAAAAAAAADP1EbmSCsAAAAP55kfTGVuZ2xldDIwMTFDaGFyYWN0ZXJpI0ZFODNCLnBkZgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA/oO8q8hfEAAAAAAAAAAAACAAMAAAkgAAAAAAAAAAAAAAAAAAAAC0JpYkRlc2tEb2NzAAAQAAgAAM/UKsYAAAARAAgAAMq8adEAAAABABAAD+eZAA+yiAAJoPYAAmb5AAIAVU1hY2ludG9zaCBIRDpVc2VyczoAc2NobWl0dGE6AERvY3VtZW50czoAQmliRGVza0RvY3M6AExlbmdsZXQyMDExQ2hhcmFjdGVyaSNGRTgzQi5wZGYAAA4ASAAjAEwAZQBuAGcAbABlAHQAMgAwADEAMQBDAGgAYQByAGEAYwB0AGUAcgBpAHoAaQBuAGcALQBDAG8AbgB0AGUALgBwAGQAZgAPABoADABNAGEAYwBpAG4AdABvAHMAaAAgAEgARAASAEhVc2Vycy9zY2htaXR0YS9Eb2N1bWVudHMvQmliRGVza0RvY3MvTGVuZ2xldDIwMTFDaGFyYWN0ZXJpemluZy1Db250ZS5wZGYAEwABLwAAFQACAA///wAAgAbSGxwdHlokY2xhc3NuYW1lWCRjbGFzc2VzXU5TTXV0YWJsZURhdGGjHR8gVk5TRGF0YVhOU09iamVjdNIbHCIjXE5TRGljdGlvbmFyeaIiIF8QD05TS2V5ZWRBcmNoaXZlctEmJ1Ryb290gAEACAARABoAIwAtADIANwBAAEYATQBVAGAAZwBqAGwAbgBxAHMAdQB3AIQAjgDQANUA3QLTAtUC2gLlAu4C/AMAAwcDEAMVAyIDJQM3AzoDPwAAAAAAAAIBAAAAAAAAACgAAAAAAAAAAAAAAAAAAANB}
}
@comment{{Local Variables:
  bibtex-dialect: biblatex
  End:
}}