ANR PACE project

PACE project: publications

   2013  -  2014  -  2015  -  2016

Papers marked with a "star" are the result of joint work between members of different sites in PACE.

2013

Journal papers

• C. Olarte, C. Rueda, F. Valencia. Models and emerging trends of concurrent constraint programming. Constraints, Springer, 2013, 18 (4), pp. 535-578. www (T1.5)
• Yuxi Fu. The Value-Passing Calculus. Theories of Programming and Formal Methods, Essays Dedicated to Jifeng He on the Occasion of His 70th Birthday, LNCS 8051, 166-195, 2013. www (T2.1)
• Ugo Dal Lago and Paolo Parisen Toldin. An higher-order characterization of probabilistic polynomial time. Information and Computation, 2013. to appear. (T1.3)
• Alexandra Silva, Filippo Bonchi, Marcello Bonsangue, Jan Rutten, “Generalizing determinization from automata to coalgebras” In Logical Methods in Computer Science 9(1) (2013) www (T3.1)

Conference and workshop papers

• Filippo Bonchi, Fabio Zanasi, “Saturated Semantics for Coalgebraic Logic Programming” In Proc. of CALCO, LNCS 8089, Springer 2013. www (T1)
• Damien Pous. Coalgebraic Up-to Techniques. Invited talk at CALCO 2013. LNCS 8089 (T1.1)
• D. Hirschkoff, J.-M. Madiot and D. Sangiorgi, Name-Passing Calculi: From Fusions to Preorders and Types. LICS 2013: 378-387 www (T1 & T2.1)
• Alessandro Facchini, Yde Venema, and Fabio Zanasi. A characterization theorem for the alternation-free fragment of the modal μ-calculus. In LICS, pages 478–487, 2013. www
• Damien Pous. Kleene Algebra with Tests and Coq Tools for while Programs. In Proc. ITP 2013, LNCS 7998. www (T3.1)
• Filippo Bonchi, Georgiana Caltais, Damien Pous, Alexandra Silva. Brzozowski’s and Up-To Algorithms for Must Testing. Invited talk. In Proc. APLAS 2013. LNCS 8089. www (T3.1)
• Ugo Dal Lago and Giulio Pellitta. Complexity analysis in presence of control operators and higher-order functions. In LPAR, pages 258–273, 2013. www
• L. Pino, F. Bonchi and F. Valencia. Efficient computation of program equivalence for confluent concurrent constraint programming. 15th International Symposium on Principles and Practice of Declarative Programming, PPDP '13 pp. 263-274. www (T1.5)
• Chatzikokolakis, Konstantinos; Andres, Miguel, E.; Bordenabe, Nicolas, E.; Palamidessi, Catuscia. Broadening the Scope of Differential Privacy Using Metrics. The 13th Privacy Enhancing Technologies Symposium 7981 (2013) 82-102. www (T2.3)
• Konstantinos Chatzikokolakis, Catuscia Palamidessi, Marco Stronati. Geo-Indistinguishability: Differential Privacy for Location-Based Systems. 20th ACM Conference on Computer and Communications Security (2013) 901-914. www (T2.3)
• I. Gazeau, D. Miller, C. Palamidessi. Preserving differential privacy under finite-precision semantics. QAPL - 11th International Workshop on Quantitative Aspects of Programming Languages and Systems (2013). www (T2.3 & T3)
• Elsalamouny, Ehab; Chatzikokolakis, Konstantinos; Palamidessi, Catuscia, A differentially private mechanism of optimal utility for a region of priors, Proc. of the ETAPS Conference on Principles of Security and Trust. David Basin and John Mitchel (eds.), LNCS 7796. Springer, 41-62 (2013) www (T2.3)
• Xian Xu. On Context Bisimulation for Parameterized Higher-order Processes. Proceedings of the 6th Interaction and Concurrency Experience (ICE 2013), 2013. Electronic Proceedings in Theoretical Computer Science 131: 37-51, 2013. (T1)
• Xian Xu, Qiang Yin and Huan Long. On the Expressiveness of Parameterization in Process-passing. (post-proceedings of WS-FM2013, in LNCS) www (T2.1)
• Guoqiang Li, Xiaojuan Cai, Mizuhito Ogawa, Shoji Yuen. Nested Timed Automata. In Proceedings of the 11th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS'13), LNCS 8053, 168-182, 2013. www (T2)
• Yuxi Fu. Checking Equality and Regularity for Normed BPA with Silent Moves. F.V. Fomin et al. (Eds.): ICALP 2013, Part II, LNCS 7966, 244-255, 2013. www (T2)
• Xiaojuan Cai, Mizuhito Ogawa. Well-Structured Pushdown Systems. In Proceedings of the 24th International Conference on Concurrency Theory (CONCUR’13), LNCS 8052, 121-136, 2013. www (T2)

Technical report and unpublished documents

• Ugo Dal Lago and Margherita Zorzi. Wave-style token machines and quantum lambda calculi. 2013. (T1.4)

*

2014

Journal papers

• L. Pino, A. Aristizabal, F. Bonchi, F. Valencia. Weak CCP Bisimilarity with Strong Procedures. Science of Computer Programming. 2014. www (T1.5)
• T. Given-Wilson; D. Gorla; B. Jay. A Concurrent Pattern Calculus. Logical Methods in Computer Science (2014). www (T2.1)
• E. ElSalamouny. K. Chatzikokolakis, C. Palamidessi. Generalized differential privacy: regions of priors that admit robust optimal mechanisms. Horizons of the Mind. A Tribute to Prakash Panangaden Springer International Publishing (Ed.) (2014) 292-318. www (T2.3) s
• K. Chatzikokolakis, C. Palamidessi, C. Braun. Compositional Methods for Information-Hiding. Mathematical Structures in Computer Science, Cambridge University Press, 2014. www (T2.3 )
• Yuxi Fu. Nondeterministic Structure of Computation. Mathematical Structures in Computer Science, to appear, 2014. www (T2.1)
• Yuxin Deng, Rob van Glabbeek, Matthew Hennessy, and Carroll Morgan. Real-Reward Testing for Probabilistic Processes. Theoretical Computer Science. Elsevier, 2014. To appear. www (T1.3)
• Yuan Feng, Yuxin Deng, and Mingsheng Ying. Symbolic bisimulation for quantum processes. ACM Transactions on Computational Logic, Vol. 15, No. 2, Article 14, April 2014. www (T3)
• Yuxin Deng, Rob J. Simmons, and Iliano Cervesato. Relating Reasoning Methodologies in Linear Logic and Process Algebra. Mathematical Structures in Computer Science, pages 1-39. Cambridge University Press, December 2014. www
• Yang Fei, Huang Hao, A Polynomial Time Algorithm for Checking Regularity of Totally Normed Process Algebra, J. Shanghai Jiaotong Univ. (Sci.), 2014,DOI: 10.1007/s12204-014-1555-x.
• F. Bonchi, M. Bonsangue, H.H. Hansen, P. Panangaden, J. Rutten and A. Silva. Algebra-coalgebra duality in Brzozowski's minimization algorithm. In ACM Transactions on Computational Logic, 15(1): 3 (2014). www (T3.1)
• Filippo Bonchi, Fabio Gadducci, Giacoma Valentina Monreale: A General Theory of Barbs, Contexts, and Labels. ACM Trans. Comput. Log. 15(4): 35:1-35:27 (2014) (T1)

Conference papers

• F. Bonchi, D. Petrisan, D. Pous and J. Rot, Coinduction up-to in a fibrational setting. Proc. of CSL-LICS 2014. www (T1)
• F. Bonchi, S. Millius, A. Silva and F. Zanasi. How to Kill Epsilons with a Dagger: A Coalgebraic Take on Systems with Algebraic Label Structure. Prooceedings of CMCS 2014. www (T3)
• F. Bonchi, P. Sobocinski, F. Zanasi. Interacting Bialgebras are Frobenius. In the proc. of the 15th International Conference on Foundations Of Software Science And Computation Structures LNCS 8412, pp. 351-365. Springer, 2014. www (T2)
• P. Baldan, F. Bonchi, F. Gadducci, and G. V. Monreale. Encoding Synchronous Interactions using Labelled Petri Nets. In COORDINATION 2014. LNCS 8459, pp. 1-16. (T2)
• Facundo Carreiro, Alessandro Facchini, Yde Venema, and Fabio Zanasi. Weak MSO: Automata and expressiveness modulo bisimilarity. In CSL-LICS, 2014. www
• Paul Brunet, Damien Pous: Kleene Algebra with Converse. In Proc. RAMICS 2014, LNCS 8428, Springer, 2014. www (T3.1)
• Jean-Marie Madiot, Damien Pous, Davide Sangiorgi: Bisimulations up-to: beyond first-order transition systems. Proc. CONCUR 2014, Springer, 2014. www (T3.1)
• Filippo Bonchi, Stefan Milius, Alexandra Silva, Fabio Zanasi, How to Kill Epsilons with a Dagger - A Coalgebraic Take on Systems with Algebra Label Structure. CMCS 2014, LNCS 8446: 53-74 www (T2)
• Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi, A Categorical Semantics of Signal Flow Graphs. CONCUR 2014, LNCS 8704: 435-450 www (T2)
• Paolo Baldan, Filippo Bonchi, Henning Kerstan, Barbara König, Behavioral Metrics via Functor Lifting. FSTTCS 2014: 403-415 www
• Ugo Dal Lago, Davide Sangiorgi, and Michele Alberti. On coinductive equivalences for higher-order probabilistic functional programs. In POPL, pages 297–308, 2014. www (T1.3)
• Beniamino Accattoli and Ugo Dal Lago. Beta reduction is invariant, indeed. In Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS ’14, Vienna, Austria, July 14 - 18, 2014, page 8, 2014.
• Marco Bernardo, Davide Sangiorgi, and Valeria Vignudelli. On the discriminating power of passivation and higher-order interaction. In Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS ’14, Vienna, Austria, July 14 - 18, 2014, page 14. ACM, 2014. www (T1.3)
• Marco Bernardo, Davide Sangiorgi, and Valeria Vignudelli. On the discriminating power of testing equivalences for reactive probabilistic systems: Results and open problems. In Quantitative Evaluation of Systems - 11th International Conference, QEST 2014, Florence, Italy, September 8-10, 2014. Proceedings, volume 8657 of Lecture Notes in Computer Science, pages 281– 296. Springer, 2014. www (T1.3)
• Raphaëlle Crubillé and Ugo Dal Lago. On probabilistic applicative bisimulation and call-by-value λ-calculi. In Programming Languages and Systems - 23rd European Symposium on Programming, ESOP 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings, pages 209–228, 2014. www
• Ugo Dal Lago, Claudia Faggian, Ichiro Hasuo, and Akira Yoshimizu. The geometry of synchronization. In Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS ’14, Vienna, Austria, July 14 - 18, 2014, page 35, 2014.
• Ugo Dal Lago and Sara Zuppiroli. Probabilistic recursion theory and implicit computational complexity. In Theoretical Aspects of Computing - ICTAC 2014 - 11th International Colloquium, Bucharest, Romania, September 17- 19, 2014. Proceedings, pages 97–114, 2014. (T1.3)
• Davide Sangiorgi and Xian Xu. Trees from functions as processes. In CONCUR 2014 - Concurrency Theory - 25th International Conference, CONCUR 2014, Rome, Italy, September 2-5, 2014. Proceedings, volume 8704 of Lecture Notes in Computer Science, pages 78–92. Springer, 2014. www (T1)
• L. Pino, F. Bonchi, F. Valencia. A Behavioural Congruence for Concurrent Constraint Programming with Non-Deterministic Choice. ICTAC 2014 - 11th International Colloquium on Theoretical Aspects of Computing (2014). www (T1.5)
• T. Given-Wilson. An Intensional Concurrent Faithful Encoding of Turing Machines. 7th Interaction and Concurrency Experience (ICE 2014) (2014). www (T2.1)
• T. Given-Wilson. Expressiveness via Intensionality and Concurrency. ICTAC 2014 - 11th International Colloquium on Theoretical Aspects of Computing (2014). www (T2.2)
• Chatzikokolakis, Konstantinos and Palamidessi, Catuscia and Stronati, Marco. A Predictive Differentially-Private Mechanism for Mobility Traces. Proceedings of the 14th International Symposium on Privacy Enhancing Technologies (PETS 2014). www (T2.2)
• Kawamoto, Yusuke and Chatzikokolakis, Konstantinos and Palamidessi, Catuscia. Compositionality Results for Quantitative Information Flow. Proceedings of the 11th International Conference on Quantitative Evaluation of SysTems (QEST 2014). www (T2.3)
• Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Marco Stronati. Location Privacy via Geo-Indistinguishability. In Martin Leucker, Camilo Rueda, and Frank D. Valencia, editors, Proceedings of the 12th International Colloquium on Theoretical Aspects of Computing (ICTAC), volume 9399 of Lectures Notes in Computer Science, pages 28–38, Cali, Colombia, 2015c. Springer. www. (T2.3)
• Konstantinos Chatzikokolakis, Daniel Gebler, Catuscia Palamidessi, and Lili Xu. Generalized bisimulation metrics. In Paolo Baldan and Daniele Gorla, editors, CONCUR - 25th Conference on Concurrency Theory, volume 8704 of Lecture Notes in Computer Science, pages 32-46, Rome, Italy, Septem- ber 2014. Springer. www (T1.2)
• Nicolas E. Bordenabe, Konstantinos Chatzikokolakis, and Catuscia Palamidessi. Optimal Geo-Indistinguishable Mechanisms for Location Privacy. In Gail-Joon Ahn, Moti Yung, and Ninghui Li, editors, CCS - 21st ACM Conference on Computer and Communications Security, pages 251-262, Scottsdale, Arizona, United States, November 2014. Gail-Joon Ahn, ACM. www (T2.3)
• Thomas Given-Wilson. On the Expressiveness of Intensional Communication. In Johannes Borgstrom and Silvia Crafa, editors, Combined 21th International Workshop on Expressiveness in Concurrency and 11th Workshop on Structural Operational Semantics, volume 160 of Electronic Proceedings in Theoretical Computer Science, pages 30-46, Rome, Italy, September 2014. Open Publishing Association. www (T2.2)
• Lili Xu, Konstantinos Chatzikokolakis, and Huimin Lin. Metrics for Differential Privacy in Concurrent Systems. In Erika Abraham and Catuscia Palamidessi, editors, FORTE - 34th IFIP International Conference on Formal Techniques for Distributed Objects, Components and Systems, volume 8461 of Lecture Notes in Computer Science, pages 199–215, Berlin, Germany, June 2014. IFIP, Springer. doi: 10.1007/978-3-662-43613-4 13. www. (T2.3)
• Qiang Yin, Yuxi Fu, Chaodong He, Mingzhang Huang, Xiuting Tao. Branching Bisimilarity Checking for PRS. J. Esparza et al. (Eds.): ICALP 2014, Part II, Lecture Notes in Computer Science 8573, 363--374, 2014. www (T2)
• Yuxin Deng and Yu Zhang. Program Equivalence in Linear Contexts. Theoretical Computer Science. Elsevier, 2014. Theoretical Computer Science, 585: 71-90, 2015. www (T3)
• Mizuhito Ogawa and Xiaojuan Cai. Well-structured pushdown system: Case of Dense Timed Pushdown Automata. In Proceedings of the 12th International Symposium on Functional and Logic Programming (FLOPS’14). LNCS. 2014 www (T2)
• Yuxin Deng and Hengyang Wu. Model Modal Characterisations of Probabilistic and Fuzzy Bisimulations. In Proceedings of the 16th International Conference on Formal Engineering Methods. Lecture Notes in Computer Science 8829, pages 123-138. Springer, 2014.

Workshop paper

• Yunqing Wen, Guoqiang Li, Shoji Yuen. An Over-Approximation Forward Analysis for Nested Timed Automata. In Proceedings of the 4th International Workshop on SOFL + MSVL (SOFL+MSVL'14), LNCS, 2014 (T2)

*

2015

Book

• Y. Deng. Semantics of Probabilistic Processes: An Operational Approach. ISBN 978-3-662- 45197-7. Springer, February 2015.

Journal papers

• Luis Fernando Pino Duque, Filippo Bonchi, and Frank D. Valencia. Efficient Algorithms for Program Equivalence for Confluent Concurrent Constraint Programming. Science of Computer Programming, 2015. www (T1.5)
• M. Falaschi, C. Olarte, C. Palamidessi. Abstract Interpretation of Temporal Concurrent Constraint Programs. Theory and Practice of Logic Programming CUP. Theory and Practice of Logic Programming, 15(3): 312-357 (2015) www (T1.5)
• M. Alvim, M. Andrés, K. Chatzikokolakis, P. Degano, C. Palamidessi. On the information leakage of differentially-private mechanisms. Journal of Computer Security. 2014, to appear. www (T2.3)
• Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Marco Stronati. Constructing elastic distinguishability metrics for location privacy. Proceedings on Privacy Enhancing Technologies, 2015(2): 156–170, June 2015a. doi: 10.1515/popets-2015-0023. www. (T2.3)
• Luis Pino, Andres Aristizabal, Filippo Bonchi, and Frank Valencia. Weak CCP bisimilarity with strong procedures. Science of Computer Programming, 100:84–104, 2015. doi: 10.1016/j.scico.2014.09.007. www. (T1.5)
• Miguel E. Andrés, Geoffrey Smith, and Catuscia Palamidessi. Special Issue on Quantitative Information Flow, volume 25 of Mathematical Structures in Computer Science. Cambridge University Press, 2015. doi: 10.1017/S0960129513000583. www. (T2.3)
• F. Bonchi, D. Pous, Hacking Nondeterminism with Induction and Coinduction. Research Highlights in Communications of the ACM, Vol. 58 No. 2, 2015.
  
• D. Hirschkoff, J.-M. Madiot and X. Xian, A Behavioural Theory for a pi-calculus with Preorders. Accepted for publication in Journal of Logical and Algebraic Methods in Programming, Elsevier (long version of the paper published at FSEN'15). (T1 & T2.1)
• Filippo Bonchi, Fabio Zanasi: Bialgebraic Semantics for Logic Programming. Logical Methods in Computer Science Vol. 11(1:14)2015, pp. 1–47 (T2)
• Jurriaan Rot, Filippo Bonchi, Marcello Bonsangue, Damien Pous, Jan Rutten, and Alexandra Silva. Enhanced coalgebraic bisimulation. Mathematical Structures in Computer Science, December 2015. doi: 10.1017/S0960129515000523. www. (T1.1)
• Y. Fu, Theory of Interaction. Theoretical Computer Science, accepted for publication, 2015.
• Lichao Wang, Guoqiang Li, Zhenjiang Hu. Constructing Format-Preserving Printing from Syntax-Directed Definition. Science China Information Sciences. 2015. To appear.

Conference papers

• Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Marco Stronati. Geo-indistinguishability: A Principled Approach to Location Privacy. In Gautam Barua Raja Natarajan and Manas Ranjan Patra, editors, ICDCIT 2015 - Proceedings of the 11th International Conference on Distributed Computing and Internet Technology , volume 8956 of Lecture Notes in Computer Science, pages 49-72, Bhubaneswar, India, February 2015. Springer. www (T2.3)
• Yusuke Kawamoto and Thomas Given-Wilson. Quantitative Information Flow for Scheduler-Dependent Systems. In The 13th International Workshop on Quantitative Aspects of Programming Languages and Systems (QAPL 2015), Electronic Proceedings in Theoretical Computer Science, page to appear, London, United Kingdom, April 2015. Open Publishing Association. www (T2.3)
• Fabio Gadducci, Francesco Santini, Luis Fernando Pino, Frank D. Valencia: A Labelled Semantics for Soft Concurrent Constraint Programming. COORDINATION 2015: 133-149 (T1.5)
• Stefan Haar, Salim Perchy, Camilo Rueda, Frank D. Valencia. An algebraic view of space/belief and extrusion/utterance for concurrency/epistemic logic. PPDP 2015: 161-172 (T2.2)
• Catuscia Palamidessi. Quantitative Approaches to the Protection of Private Information: State of the Art and Some Open Challenges. Proc. of Principles of Security and Trust 2015: 3-7 (T2.3)
• Salim Perchy and Frank Valencia. Opinions and Beliefs as constraint system operators. In Marina De Vos, Thomas Eiter, Yuliya Lierler, and Francesca Toni, editors, Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015), volume 1 of Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015), page 1, Cork, Ireland, August 2015. www. Appears as Abstract Paper at the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015). (T1.5)
• Stefan Haar, Salim Perchy, Camilo Rueda, and Frank Valencia. An Algebraic View of Space/Belief and Extrusion/Utterance for Concurrency/Epistemic Logic. In Elvira Albert and Moreno Falaschi, editors, 17th International Symposium on Principles and Practice of Declarative Programming (PPDP 2015), Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming (PPDP 2015), pages 161–172, Siena, Italy, July 2015. ACM SIGPLAN. doi: 10.1145/2790449.2790520. www. (T1.5)
• Davide Sangiorgi. Equations, contractions, and unique solutions. In Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, Mumbai, India, January 15-17, 2015, pages 421–432. ACM, 2015. www (T1)
• Raphaëlle Crubillé and Ugo Dal Lago. Metric Reasoning About Lambda-Terms: The Affine Case. Proceedings of LICS'2015. www (T1.2)
• Ugo Dal Lago, Claudia Faggian, Benoit Valiron, Akira Yoshimizu Parallelism and Synchronization in an Infinitary Context. Proceedings of LICS'2015. www (T1)
• Yuxin Deng, Yuan Feng, and Ugo Dal Lago. On Coinduction and Quantum Lambda Calculi. In Proceedings of the 26th International Conference on Concurrency Theory (CONCUR'15), 2015. To appear. www (T1.3)
• Raphaëlle Crubillé, Ugo Dal Lago, Davide Sangiorgi, and Valeria Vignudelli. On Applicative Similarity, Sequentiality, and Full Abstraction. In Correct System Design. Symposium in Honor of Ernst- Rüdiger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 2015. doi: 10.1007/978-3-319-23506-6 7. www. (T1.3)
• D. Pous, Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests, web page, .pdf. in Proc. POPL'15, January 2015. (T3.1)
• P. Brunet and D. Pous, Decidability of Identity-free Relational Kleene lattices.
  in Proc. JFLA'15, January 2015. (T3.1)
• Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi, Full Abstraction for Signal Flow Graphs. POPL 2015: 515-526 www (T1)
• D. Hirschkoff, J.-M. Madiot and X. Xian, A Behavioural Theory for a pi-calculus with Preorders. Proc. of FSEN 2015. best paper award www (T1 & T2.1)
• Paul Brunet and Damien Pous. Petri automata for Kleene allegories. Proceedings of LICS'2015. www (T3.1)
• Filippo Bonchi, Daniela Petrisan, Damien Pous and Jurriaan Rot. Lax Bialgebras and Up-To Techniques for Weak Bisimulations. Proceedings of CONCUR'15. (T1.1)
• Paolo Baldan, Filippo Bonchi, Henning Kerstan, Barbara König: Towards Trace Metrics via Functor Lifting, to appear in the proceedings of CALCO 2015. (T2)
• C. He and M. Huang, Branching bisimilarity on nBPA is EXPTIME complete. Proceedings of LICS 2015.
• Guoqiang Li, Mizuhito Ogawa and Shoji Yuen, Nested Timed Automata with Frozen Clocks. Proceedings of FORMATS'15. (T2)

Workshop papers

• Xian Xu, Qiang Yin, Huan Long, On the Computation Power of Name Parameterization in Higher-order Processes, Proceedings of ICE'2015. www (T1)
• Bingbing Fang, Guoqiang Li, Ling Fang, Jianwen Xiang. A Refined Algorithm for Reachability Analysis of Updatable Timed Automata. In Proceedings of the 1st IEEE International Workshop on Software Engineering and Knowledge Management (SEKM'15) (T3)
• Yunqing Wen, Guoqiang Li, Shoji Yuen. On Reachability Analysis of Updatable Timed Automata with One Updatable Clock. In Proceedings of the 5th International Workshop on SOFL + MSVL (SOFL+MSVL'15) (T3)

In preparation

• Yuxi Fu and Qiang Yin, The Decidability of epsilon-Pushing PDA, 2015 www (T2)

*

2016

Journal papers

• Paul Brunet, Damien Pous, Algorithms for Kleene algebra with converse, Relational and algebraic methods in computer science, Journal of Logical and Algebraic Methods in Programming Volume 85, Issue 4, June 2016, Pages 574–594. (T3.1)
• Yuxin Deng, Robert J. Simmons, Iliano Cervesato, Relating reasoning methodologies in linear logic and process algebra. Mathematical Structures in Computer Science 26(5): 868-906 (2016) (T1)
• Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi, Name-passing calculi: From fusions to preorders and types. Inf. Comput. 251: 335-360 (2016) (T1 & T2.1)

Conference papers

• Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Valeria Vignudelli. Up-To Techniques for Generalized Bisimulation Metrics. In 27th International Conference on Concurrency Theory (CONCUR), page to appear, Québec City, Canada, August 2016. doi: 10.4230/LIPIcs.CONCUR.2016.35. www. (T2.3)
• Mário S. Alvim, Konstantinos Chatzikokolakis, Annabelle McIver, Carroll Morgan, Catuscia Palamidessi, and Geoffrey Smith. Axioms for Information Leakage. In 29th Computer Security Foundations Symposium (CSF 2016), page 16, Lisbon, Portugal, June 2016. IEEE. www. (T2.3)
• Davide Sangiorgi, Valeria Vignudelli: Environmental bisimulations for probabilistic higher-order languages. POPL 2016: 595-607 (T1.3)
• Paul Brunet and Damien Pous, Formal Exploration of Nominal Kleene Algebra Proc. MFCS 2016, Leibniz International Proceedings in Informatics (LIPIcs), 22:1--22:13, 2016. (T3.1)
• Paul Brunet, Damien Pous, Insa Stucke Cardinalities of Finite Relations in Coq Proc. of Interactive Theorem Proving, Volume 9807 of the series Lecture Notes in Computer Science pp 466-474, 2016. (T3.1)
• D. Pous, Coinduction all the way up, in Proc LICS'16, 2016. (T1.1)
• Wenjie Du, Yuxin Deng, Daniel Gebler, Behavioural Pseudometrics for Nondeterministic Probabilistic Systems. SETTA 2016: 67-84 (T2.3)

In preparation

• Michell Guzman, Stefan Haar, Salim Perchy, Camilo Rueda, and Frank Valencia. Belief, Knowledge, Lies and Other Utterances in an Algebra for Space and Extrusion. Submitted, May 2016. www.