???global.info.a_carregar???
Sabine Broda is an associate professor at the Department of Computer Science, Faculty of Sciences, University of Porto, Portugal. She completed a PhD degree in Computer Science in 1997 by Faculty of Sciences, University of Porto. She was a researcher at the Artificial Intelligence and Computer Science Laboratory (LIACC) since its foundation (1986) until 2011. She is now a senior researcher at Center of Mathematics of University of Porto (CMUP). Her current research interests are in the area of lambda calculus and type theory; automata theory and formal languages; descriptional complexity; and dependable software. In those areas she has published 18 papers in international journals and 22 papers in international conference proceedings with independent refereeing system. She continually contributes as a referee for papers submitted to, both international journals and conferences. She participates/has participated in 5 research projects. She has been a member of program committees, as well as organising committees, of several international conferences.
Read full resume ↓
Identification

Personal identification

Full name
Sabine Broda

Citation names

  • Broda, Sabine

Author identifiers

Ciência ID
0519-A4F3-324E
ORCID iD
0000-0002-3798-9348
Education
Degree Classification
1997/02/07
Concluded
 n/a (Doutoramento)
Major in Ciência de Computadores
Universidade do Porto Faculdade de Ciências, Portugal
"Sobre Bases de Combinadores para Sistemas de Lambda Calculus" (THESIS/DISSERTATION)
 Aprovada por unanimidade
1987
Concluded
 Matemática Aplicada (Doutoramento)
Universidade do Porto Faculdade de Ciências, Portugal
 14
Affiliation

Teaching in Higher Education

Category
Host institution 		Employer
2016 - 2018 Associate Professor (University Teacher) Universidade do Porto, Portugal
2013 - 2016 Associate Professor (University Teacher) Universidade do Porto Faculdade de Ciências, Portugal

Positions / Appointments

Category
Host institution 		Employer
2013 - 2015 Conselho científico/técnico-científico ou orgão correspondente Universidade do Porto Faculdade de Ciências, Portugal
Projects

Contract

Designation Funders
2017/07/01 - 2019/07/01 Elven
PTDC/EEI-CTP/3506/2014
Researcher
Concluded
2012/05/01 - 2015/04/01 AVIACC
PTDC/EIA-CCO/117590/2010
Researcher
Concluded
2010/05/01 - 2013/05/01 CANTE
PTDC/EIA-CCO/101904/2008
Researcher
National Science Foundation
Concluded
2008/01/01 - 2012/12/01 RESCUE
FCT/PTDC/EIA/65862/2006
Researcher
Concluded
1999/06/01 - 2001/05/01 CORE: Sistemas Formais e Complexidade Computacional
PraxisXXI/P/EEI/ 14233/1998
 Fundação para a Ciência e a Tecnologia
Concluded
Outputs

Publications

Book
  1. Faculdade de Ciências. Partial Derivative Automaton for Regular Expressions with Shuffle. 2015.
    10.1007/978-3-319-19225-3_2
  2. Faculdade de Ciências. Deciding synchronous Kleene algebra with derivatives. 2015.
    10.1007/978-3-319-22360-5_5
Book chapter
  1. Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis. "Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions". 2023.
    10.1007/978-3-031-40247-0_7
  2. Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis. "Location Based Automata for Expressions with Shuffle". 43-54. Springer International Publishing, 2021.
    10.1007/978-3-030-68195-1_4
Conference paper
  1. Broda, S; Machiavelo, A; Moreira, N; Reis, R. "On the Uniform Distribution of Regular Expressions". 2021.
    10.1007/978-3-030-93489-7_2
  2. Alves, S; Broda, S. "Pre-grammars and Inhabitation for a Subset of Rank 2 Intersection Types". 2019.
    10.1016/j.entcs.2019.07.003
  3. Alves, S; Broda, S. "A Unifying Framework for Type Inhabitation". 2018.
  4. Sandra Alves; Broda,Sabine. "Inhabitation machines: determinism and principality". 2017.
  5. Alves, Sandra; Broda, Sabine. "Inhabitation machines: determinism and principality". 2017.
  6. Broda, S; Machiavelo, A; Moreira, N; Reis, R. "On the Average Complexity of Strong Star Normal Form". 2017.
    10.1007/978-3-319-60252-3_6
  7. Broda, S; Holzer, M; Maia, E; Moreira, N; Reis, R. "On the Mother of All Automata: The Position Automaton". 2017.
    10.1007/978-3-319-62809-7_9
  8. Bastos, R; Broda, S; Machiavelo, A; Moreira, N; Reis, R. "On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection". 2016.
    10.1007/978-3-319-41114-9_4
  9. Broda, S; Machiavelo, A; Moreira, N; Reis, R. "Position Automaton Construction for Regular Expressions with Intersection". 2016.
    10.1007/978-3-662-53132-7_5
  10. Alves, S; Broda, S; Fernandez, M. "A Typed Language for Events". 2015.
    10.1007/978-3-319-27436-2_7
  11. Broda, Sabine. "On the Equivalence of Automata for KAT-expressions". 2014.
    http://dx.doi.org/10.1007/978-3-319-08019-2_8
  12. Broda, S; Machiavelo, A; Moreira, N; Reis, R. "On the Equivalence of Automata for KAT-expressions". 2014.
    10.1007/978-3-319-08019-2_8
  13. Almeida, R; Broda, S; Moreira, N. "Deciding KAT and Hoare Logic with Derivatives". 2012.
    10.4204/EPTCS.96.10
  14. Broda, S; Damas, L. "A New Translation Algorithm from Lambda Calculus into Combinatory Logic". 1995.
    10.1007/3-540-60428-6_30
  15. Damas, L; Moreira, N; Broda, S. "Resolution of Constraints in Algebras of Rational Trees". 1993.
    10.1007/3-540-57287-2_38
Journal article
  1. Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis. "Location automata for regular expressions with shuffle and intersection". Information and Computation (2023): https://doi.org/10.1016/j.ic.2022.104917.
    10.1016/j.ic.2022.104917
  2. Broda, S; Machiavelo, A; Moreira, N; Reis, R. "Location automata for synchronised shuffle expressions". JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING (2023):
    10.1016/j.jlamp.2023.100847
  3. Broda, Sabine. "Pregrammars and Intersection Types". Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021): https://drops.dagstuhl.de/opus/volltexte/2021/13448/.
    10.4230/LIPICS.CSL.2021.14
  4. Broda, S; Maia, E; Moreira, N; Reis, R. "The Prefix Automaton". J. Autom. Lang. Comb. (2021):
    10.25596/jalc-2021-017
  5. Broda, S; Machiavelo, A; Moreira, N; Reis, R. "Guest Column: Analytic Combinatorics and Descriptional Complexity of Regular Languages on Average". SIGACT News (2020):
    10.1145/3388392.3388401
  6. Broda, S; Holzer, M; Maia, E; Moreira, N; Reis, R. "A mesh of automata". INFORMATION AND COMPUTATION (2019):
    10.1016/j.ic.2019.01.003
  7. Broda, S; Machiavelo, A; Moreira, N; Reis, R. "On Average Behaviour of Regular Expressions in Strong Star Normal Form". INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE (2019):
    10.1142/s0129054119400227
  8. Broda, S; Machiavelo, A; Moreira, N; Reis, R. "Automata for regular expressions with shuffle". INFORMATION AND COMPUTATION (2018):
    10.1016/j.ic.2017.08.013
  9. Broda, S; Machiavelo, A; Moreira, N; Reis, R. "Position Automata for Semi-extended Expressions". Journal of Automata, Languages and Combinatorics (2018):
  10. Bastos, R; Broda, S; Machiavelo, A; Moreira, N; Reis, R. "On the Average Complexity of Partial Derivative Automata for Semi-extended Expressions". Journal of Automata, Languages and Combinatorics (2017):
  11. Alves, S; Broda, S. "A short note on type-inhabitation: Formula-trees vs. game semantics". INFORMATION PROCESSING LETTERS (2015): https://www.authenticus.pt/P-00G-FE1.
    10.1016/j.ipl.2015.05.004
  12. Broda, S; Machiavelo, A; Moreira, N; Reis, R. "Average Size of Automata Constructions from Regular Expressions". Bulletin of the EATCS (2015):
  13. Broda, Sabine. "A Hitchhiker's Guide to descriptional complexity through analytic combinatorics". Journal of Theoretical Computer Science 528 (2014): 85-100. http://dx.doi.org/10.1016/j.tcs.2014.02.013.
    10.1016/j.tcs.2014.02.013
  14. Broda, S.; Machiavelo, A.; Moreira, N.; Reis, R.. "On the average size of Glushkov and equation automata for KAT expressions". Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 8070 LNCS (2013): 72-83. http://www.scopus.com/inward/record.url?eid=2-s2.0-84883171674&partnerID=MN8TOARS.
    10.1007/978-3-642-40164-0_10
  15. Broda, S.; MacHiavelo, A.; Moreira, N.; Reis, R.. "On the average size of glushkov and partial derivative automata". International Journal of Foundations of Computer Science 23 5 (2012): 969-984. http://www.scopus.com/inward/record.url?eid=2-s2.0-84867198775&partnerID=MN8TOARS.
    10.1142/S0129054112400400
  16. Broda, S.; Machiavelo, A.; Moreira, N.; Reis, R.. "The average transition complexity of glushkov and partial derivative automata". Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6795 LNCS (2011): 93-104. http://www.scopus.com/inward/record.url?eid=2-s2.0-79960733964&partnerID=MN8TOARS.
    10.1007/978-3-642-22321-1_9
  17. Broda, S.; MacHiavelo, A.; Moreira, N.; Reis, R.. "On the average state complexity of partial derivative automata: An analytic combinatorics approach". International Journal of Foundations of Computer Science 22 7 (2011): 1593-1606. http://www.scopus.com/inward/record.url?eid=2-s2.0-82955202691&partnerID=MN8TOARS.
    10.1142/s0129054111008908
  18. Broda, S.; MacHiavelo, A.; Moreira, N.; Reis, R.. "On the average number of states of partial derivative automata". Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6224 LNCS (2010): 112-123. http://www.scopus.com/inward/record.url?eid=2-s2.0-78049314097&partnerID=MN8TOARS.
    10.1007/978-3-642-14455-4_12
  19. Broda, S.; Damas, L.. "On principal types of BCK-¿-terms". Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4576 LNCS (2007): 120-130. http://www.scopus.com/inward/record.url?eid=2-s2.0-38149041636&partnerID=MN8TOARS.
    10.1007/978-3-540-73445-1_9
  20. Broda, S.; Damas, L.. "On long normal inhabitants of a type". Journal of Logic and Computation 15 3 (2005): 353-390. http://www.scopus.com/inward/record.url?eid=2-s2.0-20844462930&partnerID=MN8TOARS.
    10.1093/logcom/exi016
  21. Broda, S.; Damas, L.; Finger, M.; Silva e Silva, P.. "The decidability of a fragment of BB'IW-logic". Theoretical Computer Science 318 3 (2004): 373-408. http://www.scopus.com/inward/record.url?eid=2-s2.0-2442440701&partnerID=MN8TOARS.
    10.1016/j.tcs.2004.02.002
  22. Broda, S.; Damas, L.. "Studying provability in implicational intuitionistic logic: The formula tree approach". Electronic Notes in Theoretical Computer Science 67 (2002): 131-147. http://www.scopus.com/inward/record.url?eid=2-s2.0-18944367341&partnerID=MN8TOARS.
    10.1016/s1571-0661(04)80545-0
  23. Broda, S.; Damas, L.. "Counting a type's (principal) inhabitants". Fundamenta Informaticae 45 1-2 (2001): 33-51. http://www.scopus.com/inward/record.url?eid=2-s2.0-0039147941&partnerID=MN8TOARS.
  24. Broda, S.; Damas, L.. "A context-free grammar representation for normal inhabitants of types in TA¿". Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2258 LNAI (2001): 321-334. http://www.scopus.com/inward/record.url?eid=2-s2.0-20844438073&partnerID=MN8TOARS.
    10.1007/3-540-45329-6_32
  25. Broda, S.; Damas, L.. "On principal types of combinators". Theoretical Computer Science 247 1-2 (2000): 277-290. http://www.scopus.com/inward/record.url?eid=2-s2.0-0347937266&partnerID=MN8TOARS.
    10.1016/s0304-3975(99)00086-9
  26. Broda, S; Damas, L. "Counting a type's principal inhabitants - (Extended abstract)". TYPED LAMBDA CALCULI AND APPLICATIONS (1999): https://www.authenticus.pt/P-001-6AT.
    10.1007/3-540-48959-2_7
  27. Broda, S.; Damas, L.. "Compact bracket abstraction in combinatory logic". Journal of Symbolic Logic 62 3 (1997): 729-740. http://www.scopus.com/inward/record.url?eid=2-s2.0-0031505903&partnerID=MN8TOARS.
    10.2307/2275570
  28. Broda, S.; Damas, L.. "On combinatory complete sets of proper combinators". Journal of Functional Programming 7 6 (1997): 593-612. http://www.scopus.com/inward/record.url?eid=2-s2.0-0031319598&partnerID=MN8TOARS.
    10.1017/S0956796897002888
  29. BRODA, S; DAMAS, L. "On combinatory complete sets of proper combinators". Journal of Functional Programming (1997):
    10.1017/s0956796897002888
Report
  1. Faculdade de Ciências. 2010. On the average size of pd automata: an analytic combinatorics approach. https://repositorio-aberto.up.pt/handle/10216/53349.

Other

Other output
  1. On the Uniform Distribution of Regular Expressions. 2021. Broda, S; Machiavelo, A; Moreira, N; Reis, R.
  2. The G-ACM Tool: using the Drools Rule Engine for Access Control Management. 2016. Sá, J; Alves, S; Broda, S.
  3. Partial Derivative Automaton for Regular Expressions with Shuffle. 2015. Broda, S; Machiavelo, A; Moreira, N; Reis, R.