FOSSACS 2019 Contributors

Filter

Role Type

Contributing to

Number of Roles

Country

Results (100)

A Guillermo A. PerezA. Perez, Guillermo University of AntwerpBelgium The Impatient May Use Limited Optimism to Minimize Regret
Luca AcetoAceto, Luca Gran Sasso Science InstituteItaly Committee Member in Program Committee within the FOSSACS-track
S. AkshayAkshay, S. Continuous Reachability for Unordered Data Petri Nets is in PTime
Aurore AlcoleiAlcolei, Aurore Resource-Tracking Concurrent Games
Mario Alvarez-PicalloAlvarez-Picallo, Mario University of Oxford Change Actions: Models of Generalised Differentiation
B Christel BaierBaier, Christel TU Dresden, GermanyGermany Partial and Conditional Expectations in Markov Decision Processes with Integer Weights
Simone BarloccoBarlocco, Simone Coalgebra Learning via Duality
Amir Ben-AmramBen-Amram, Amir Tight Worst-Case Bounds for Polynomial Loop Programs
Dariusz BiernackiBiernacki, Dariusz University of Wrocław A Complete Normal-Form Bisimilarity for State
Achim BlumensathBlumensath, Achim Masaryk UniversityCzechia Committee Member in Program Committee within the FOSSACS-track
Mikolaj BojanczykBojanczyk, Mikolaj University of WarsawPoland Session Chair of Verification (part of FOSSACS) Session Chair of Verification (continued) (part of FOSSACS) Co-chair in Program Committee within the FOSSACS-track
Benedikt BolligBollig, Benedikt CNRS, LSV, ENS Paris-SaclayFrance Identifiers in Registers – Describing Network Algorithms with Logic
Patricia BouyerBouyer, Patricia LSV, CNRS & ENS Cachan, University Paris SaclayFrance Identifiers in Registers – Describing Network Algorithms with Logic
C Michaël CadilhacCadilhac, Michaël The Impatient May Use Limited Optimism to Minimize Regret
Simon CastellanCastellan, Simon Imperial College London, UK Causality in Linear Logic: Full Completeness and Injectivity (unit-free multiplicative-additive fragment)
Agata CiabattoniCiabattoni, Agata TU WienAustria Committee Member in Program Committee within the FOSSACS-track
Pierre ClairambaultClairambault, Pierre CNRS & ENS LyonFrance Resource-Tracking Concurrent Games
Thomas ColcombetColcombet, Thomas IRIF, University Paris Diderot and CNRS, FranceFrance Session Chair of Automata (part of FOSSACS) Invited Speaker in Invited Speaker within the FOSSACS-track
Andrea CorradiniCorradini, Andrea Rewriting Abstract Structures: Materialization Explained Categorically
Flavio CorradiniCorradini, Flavio University of CamerinoItaly Committee Member in Program Committee within the FOSSACS-track
D Luc DartoisDartois, Luc Two-Way Parikh Automata with a Visibly Pushdown Stack
Amina DoumaneDoumane, Amina Kleene algebra with hypotheses
Jérémy DubutDubut, Jérémy Trees in Partial Higher Dimensional Automata Path category for free - Open morphisms from coalgebras with non-deterministic branching
E Mnacho EchenimEchenim, Mnacho The Bernays-Schoenfinkel-Ramsey Class of Separation Logic on Arbitrary Domains
F Nathanaël FijalkowFijalkow, Nathanaël CNRS, LaBRI, and Alan Turing InstituteFrance Committee Member in Program Committee within the FOSSACS-track
Emmanuel FiliotFiliot, Emmanuel Two-Way Parikh Automata with a Visibly Pushdown Stack
G Sergey GoncharovGoncharov, Sergey FAU Erlangen-Nürnberg, Lehrstuhl 8Germany Session Chair of Categories and (Co)algebra (part of FOSSACS) Committee Member in Program Committee within the FOSSACS-track
Utkarsh GuptaGupta, Utkarsh Continuous Reachability for Unordered Data Petri Nets is in PTime
H Matthew HagueHague, Matthew Royal Holloway, University of LondonUnited Kingdom Committee Member in Program Committee within the FOSSACS-track
Geoff HamiltonHamilton, Geoff Tight Worst-Case Bounds for Polynomial Loop Programs
Ichiro HasuoHasuo, Ichiro National Institute of InformaticsJapan Path category for free - Open morphisms from coalgebras with non-deterministic branching
Daniel HausmannHausmann, Daniel Optimal Satisfiability Checking for Arithmetic mu-Calculi
Tobias HeindelHeindel, Tobias Rewriting Abstract Structures: Materialization Explained Categorically
Chris HeunenHeunen, Chris University of EdinburghUnited Kingdom Committee Member in Program Committee within the FOSSACS-track
Piotr HofmanHofman, Piotr Continuous Reachability for Unordered Data Petri Nets is in PTime
Jasper HuguninHugunin, Jasper Constructing Inductive-Inductive Types in Cubical Type Theory
I Radu IosifIosif, Radu VERIMAG, CNRS, Université Grenoble-AlpesFrance The Bernays-Schoenfinkel-Ramsey Class of Separation Logic on Arbitrary Domains
J Bart JacobsJacobs, Bart Radboud University Nijmegen Causal Inference by String Diagram Surgery
Patricia JohannJohann, Patricia Appalachian State UniversityUnited States Committee Member in Program Committee within the FOSSACS-track
K Shin-ya KatsumataKatsumata, Shin-ya National Institute of InformaticsJapan Path category for free - Open morphisms from coalgebras with non-deterministic branching
Marie KerjeanKerjean, Marie Higher-order distributions for differential linear logic
Aleks KissingerKissinger, Aleks Radboud University Causal Inference by String Diagram Surgery
Bartek KlinKlin, Bartek University of WarsawPoland Committee Member in Program Committee within the FOSSACS-track
Naoki KobayashiKobayashi, Naoki University of Tokyo, JapanJapan Committee Member in Program Committee within the FOSSACS-track
Dexter KozenKozen, Dexter CornellUnited States Committee Member in Program Committee within the FOSSACS-track
K Narayan KumarKumar, K Narayan Chennai Mathematical InstituteIndia Committee Member in Program Committee within the FOSSACS-track
Denis KuperbergKuperberg, Denis Kleene algebra with hypotheses
Orna KupfermanKupferman, Orna Hebrew UniversityIsrael Committee Member in Program Committee within the FOSSACS-track
Clemens KupkeKupke, Clemens University of StrathclydeUnited Kingdom Coalgebra Learning via Duality
Dietrich KuskeKuske, Dietrich Languages ordered by the subword order
Barbara KönigKönig, Barbara University of Duisburg-Essen Rewriting Abstract Structures: Materialization Explained Categorically
L Olivier LaurentLaurent, Olivier CNRS & ENS LyonFrance Resource-Tracking Concurrent Games
Peter Lefanu LumsdaineLefanu Lumsdaine, Peter Stockholm UniversitySweden Committee Member in Program Committee within the FOSSACS-track
Jean-Simon LemayLemay, Jean-Simon Higher-order distributions for differential linear logic
Sergueï LengletLenglet, Sergueï University of Lorraine, France A Complete Normal-Form Bisimilarity for State
Thomas LeventisLeventis, Thomas Università di BolognaItaly Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces
Paul Blain LevyLevy, Paul Blain University of BirminghamUnited Kingdom Committee Member in Program Committee within the FOSSACS-track
Christophe LucasLucas, Christophe Towards a Structural Proof Theory of Probabilistic mu–calculi
M Sebastian ManethManeth, Sebastian Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time
Radu MardareMardare, Radu Aalborg UniversityDenmark Committee Member in Program Committee within the FOSSACS-track
Cristina MatacheMatache, Cristina A Sound and Complete Logic for Algebraic Effects
Stefan MiliusMilius, Stefan Equational Axiomatization of Algebras wth Structure
Matteo MioMio, Matteo Towards a Structural Proof Theory of Probabilistic mu–calculi
Angelo MontanariMontanari, Angelo University of UdineItaly Committee Member in Program Committee within the FOSSACS-track
Anca MuschollMuscholl, Anca Université de Bordeaux / LaBRIFrance Committee Member in Program Committee within the FOSSACS-track
Rasmus Ejlers MøgelbergMøgelberg, Rasmus Ejlers IT University of CopenhagenDenmark Committee Member in Program Committee within the FOSSACS-track
N Dennis NolteNolte, Dennis University of Duisburg-Essen Rewriting Abstract Structures: Materialization Explained Categorically
O C.-H. Luke OngOng, C.-H. Luke University of OxfordUnited Kingdom Session Chair of Semantics (part of FOSSACS) Change Actions: Models of Generalised Differentiation
P Michele PaganiPagani, Michele University Paris DiderotFrance Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces
Raphaela PalentaPalenta, Raphaela Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time
Dirk PattinsonPattinson, Dirk Australian National UniversityAustralia Committee Member in Program Committee within the FOSSACS-track
Nicolas PeltierPeltier, Nicolas The Bernays-Schoenfinkel-Ramsey Class of Separation Logic on Arbitrary Domains
Daniela PetrisanPetrisan, Daniela IRIF, Université Paris DiderotFrance Committee Member in Program Committee within the FOSSACS-track
Jakob PiribauerPiribauer, Jakob Partial and Conditional Expectations in Markov Decision Processes with Integer Weights
Maciej PirógPiróg, Maciej University of WrocławPoland Equational Theories and Monads from Polynomial Cayley Representations
Andrew M. PittsPitts, Andrew M. University of Cambridge Session Chair of Resource Logics (part of FOSSACS)
Piotr PolesiukPolesiuk, Piotr University of Wrocław Equational Theories and Monads from Polynomial Cayley Representations A Complete Normal-Form Bisimilarity for State
Damien PousPous, Damien CNRS Kleene algebra with hypotheses
Pierre PradicPradic, Pierre A Dialectica-Like Interpretation of a Linear MSO on Infinite Words Kleene algebra with hypotheses
R Fabian ReiterReiter, Fabian Identifiers in Registers – Describing Network Algorithms with Logic
Arend RensinkRensink, Arend University of Twente, The NetherlandsNetherlands Rewriting Abstract Structures: Materialization Explained Categorically
Colin RibaRiba, Colin A Dialectica-Like Interpretation of a Linear MSO on Infinite Words
Jurriaan RotRot, Jurriaan Radboud University Nijmegen Coalgebra Learning via Duality
S Davide SangiorgiSangiorgi, Davide University of BolognaItaly Committee Member in Program Committee within the FOSSACS-track
Lutz SchröderSchröder, Lutz FAU Erlangen-Nürnberg, Lehrstuhl 8 Optimal Satisfiability Checking for Arithmetic mu-Calculi
Helmut SeidlSeidl, Helmut Technische Universität München Session Chair of Fixed-point Logics (part of FOSSACS) Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time
Preey ShahShah, Preey Continuous Reachability for Unordered Data Petri Nets is in PTime
Filip SieczkowskiSieczkowski, Filip University of WrocławPoland Equational Theories and Monads from Polynomial Cayley Representations
Alex SimpsonSimpson, Alex University of LjubljanaSlovenia Session Chair of Applied Categories (part of FOSSACS) Co-chair in Program Committee within the FOSSACS-track
Ana SokolovaSokolova, Ana University of SalzburgAustria Committee Member in Program Committee within the FOSSACS-track
Sam StatonStaton, Sam University of Oxford A Sound and Complete Logic for Algebraic Effects
T Jean-Marc TalbotTalbot, Jean-Marc Two-Way Parikh Automata with a Visibly Pushdown Stack
U Henning UrbatUrbat, Henning Equational Axiomatization of Algebras wth Structure
V Marie van den Bogaardvan den Bogaard, Marie The Impatient May Use Limited Optimism to Minimize Regret
Rob van Glabbeekvan Glabbeek, Rob Justness: A Completeness Criterion for Capturing Liveness Properties
W Thorsten WißmannWißmann, Thorsten Friedrich-Alexander-Universität ErlangenGermany Path category for free - Open morphisms from coalgebras with non-deterministic branching
James WorrellWorrell, James University of OxfordUnited Kingdom Committee Member in Program Committee within the FOSSACS-track
Y Nobuko YoshidaYoshida, Nobuko Imperial College London Causality in Linear Logic: Full Completeness and Injectivity (unit-free multiplicative-additive fragment)
Z Fabio ZanasiZanasi, Fabio University College London Causal Inference by String Diagram Surgery
Georg ZetzscheZetzsche, Georg Max Planck Institute for Software Systems (MPI-SWS)Germany Languages ordered by the subword order