Publications

 
  • The weak call-by-value λ-calculus is reasonable for both time and space
    Forster Y Kunze F
    Proceedings of The Acm on Programming Languages, Association For Computing Machinery (Acm) vol. 4 (POPL), 1-23.  
    20-12-2019
  • Counting induced subgraphs: An algebraic approach to #W[1]-hardness
    Dörfler J Roth M
    Leibniz International Proceedings in Informatics Lipics. vol. 138 
    01-08-2019
  • An analysis of the Podelski-Rybalchenko termination theorem via bar recursion
    Berardi S Oliva P Steila S
    Journal of Logic and Computation vol. 29 (4), 555-575.  
    01-08-2019
  • Counting answers to existential questions
    Dell H Roth M
    Leibniz International Proceedings in Informatics Lipics. vol. 132 
    01-07-2019
  • Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs
    Khouzani MHR Liu Z Malacaria P
    European Journal of Operational Research, Elsevier Bv 
    29-04-2019
  • Generalized Entropies and Metric-Invariant Optimal Countermeasures for Information Leakage Under Symmetric Constraints.
    Khouzani MHR Malacaria P
    IEEE Trans. Inf. Theory vol. 65, 888-901.  
    01-02-2019
  • Distributed programming using role-parametric session types in go: statically-typed endpoint APIs for dynamically-instantiated communication structures
    Castro D Hu R Jongmans S-S Ng N Yoshida N
    Proceedings of The Acm on Programming Languages, Association For Computing Machinery (Acm) vol. 3 (POPL), 1-30.  
    02-01-2019
  • Channel Ordering and Supermodularity
    Americo A Malacaria P Khouzani MHR
    2019 IEEE INFORMATION THEORY WORKSHOP (ITW)., 674-678.  
    01-01-2019
  • Counting induced subgraphs: A topological approach to #W[1]-hardness
    Roth M Schmitt J
    Leibniz International Proceedings in Informatics Lipics. vol. 115 
    01-01-2019
  • Deterministic Channel Design for Minimum Leakage.
    Américo A Khouzani MHR Malacaria P
    Csf, IEEE, 428-441.  
    01-01-2019