Filipe Casal, João Rasga. Revisiting the Equivalence of Shininess and Politeness. In Logic for Programming, Artificial Intelligence, and Reasoning,Lecture Notes in Computer Science, pages 198-212. Springer Berlin Heidelberg, 2013 [Biblios]

Carlos Caleiro, Filipe Casal, Andreia Mordido. Classical Generalized Probabilistic Satisfiability. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017 [Biblios]

Carlos Caleiro, Filipe Casal, Andreia Mordido. Generalized Probabilistic Satisfiability. Electronic Notes in Theoretical Computer Science, 332, Elsevier BV, 2017 [Biblios]

Filipe Casal, João Rasga. Many-Sorted Equivalence of Shiny and Strongly Polite Theories. Journal of Automated Reasoning, 60(2):221-236, Springer Nature, 2017 [Biblios]

Carlos Caleiro, Filipe Casal, Andreia Mordido. Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities. Theoretical Computer Science, Elsevier BV, 2019 [Biblios]

Filipe Casal, João Rasga, André Souto. Kolmogorov One-Way Functions Revisited. Cryptography, 2(2), MDPI AG, 2018 [Biblios]

Filipe Casal, Andreia Mordido, Vasco T. Vasconcelos. Mixed sessions. Theoretical Computer Science, 897, Elsevier BV, 2022 [Biblios]

Filipe Casal, Andreia Mordido, Vasco T. Vasconcelos. Mixed Sessions: the Other Side of the Tape. In Electronic Proceedings in Theoretical Computer Science, pages 46-60. Open Publishing Association, 2020 [Biblios]

Vasco T. Vasconcelos, Filipe Casal, Bernardo Almeida, Andreia Mordido. Mixed Sessions. In Programming Languages and Systems,Lecture Notes in Computer Science, pages 715-742. Springer International Publishing, 2020 [Biblios]