• C. Caleiro and S. Marcelino. Analytic calculi for monadic PNmatrices. In Logic, Language, Information and Computation (WoLLIC 2019), LNCS. Springer, in print.
  Get a preprint: 19-CM-axiomPNmatrices.pdf 
• C. Caleiro, S. Marcelino, and J. Marcos. Merging fragments of classical logic. In Frontiers of Combining Systems (FroCoS 2017), Lecture Notes in Artificial Intelligence. Springer-Verlag, in print.
  Get a preprint: 17-CMM-frocos.pdf 
• C. Vaz, C. Ferreira, and A. Ravara. Dynamic recovering of long running transactions. In C. Kaklamanis and F. Nielson, editors, Proceedings of the 4th Symposium on Trustworthy Global Computing TGC'08, Lecture Notes in Computer Science. Springer, in print.
  Get a preprint: 08-VFR-dynreclrt.pdf 
• P. Branco and P. Mateus. A traceable ring signature scheme based on coding theory. In Ding J. and Steinwandt R., editors, Post-Quantum Cryptography 2019, volume 11505 of Lecture Notes in Computer Science, pages 387--403. Springer, 2019.
• P. Branco and P. Mateus. A code-based linkable ring signature scheme. In Joonsang Baek, Willy Susilo, and Jongkil Kim, editors, Provable Security - 12th International Conference, ProvSec 2018, volume 11192 of Lecture Notes in Computer Science, pages 203--219. Springer, 2018.
• D. Qiu, H. Gan, G. Cai, and P. Mateus. Unambiguous discrimination between mixed quantum states based on programmable quantum state discriminators. In D. Huang, M. M. Gromiha, K. Han, and A. Hussain, editors, Proceedings of ICIC(3) 2018, volume 10956 of Lecture Notes in Computer Science, pages 700--709. Springer, 2018.
• A. Souto, L. Antunes, P. Mateus, and A. Teixeira. Witness hiding without extractors or simulators. In F. Manea, R. G. Miller, and D. Nowotka:, editors, Proceedings of CiE 2018, volume 10936 of Lecture Notes in Computer Science, pages 397--409. Springer, 2018.
• S. Marcelino and C. Caleiro. Caleiro. Disjoint fibring of non-deterministic matrices. In J. Kennedy and R. de Queiroz, editors, WoLLIC 2017: Logic, Language, Information, and Computation, volume 10388 of Lecture Notes in Computer Science, pages 242--255. Springer-Verlag, 2017.
  Get a preprint: 17-MC-wollic.pdf 
• O. Bournez, D. S. Graça, and A. Pouly. Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length - the general purpose analog computer and computable analysis are two efficiently equivalent models of computations. In I. Chatzigiannakis, M. Mitzenmacher, Y. Rabani, and D. Sangiorgi, editors, Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016), volume 55 of Leibniz International Proceedings in Informatics (LIPIcs), pages 109:1--109:15. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2016.
  Get a preprint: 16-BGP-ICALP2016.pdf 
• S. Marcelino, C. Caleiro, and P. Baltazar. Deciding theoremhood in fibred logics without shared connectives. In A. Koslow and A. Buchsbaum, editors, The Road to Universal Logic - Volume 2, Studies in Universal Logic, pages 387--406. Springer, 2015.
  Get a preprint: 14-MCB-theoremhood.pdf 
• A. Mordido and C. Caleiro. An equation-based classical logic. In V. de Paiva, R. de Queiroz, L. Moss, D. Leivant, and A. Oliveira, editors, WoLLIC 2015, Selected Papers, volume 9160 of Lecture Notes in Computer Science, pages 38--52. Springer-Verlag, 2015.
  Get a preprint: 15-MC-eqbased.pdf 
• J. Rasga, C. Sernadas, and A. Sernadas. A roadmap to decidability. In A. Koslow and A. Buchsbaum, editors, The Road to Universal Logic, Studies in Universal Logic, pages 423--445. Birkhäuser Basel, Springer, 2015.
  Get a preprint: 15-RSS-gtf03.pdf 
• P. Mateus, N. Paunkovic, J. Rodrigues, and A. Souto. Enhancing privacy with quantum networks. In B. de Decker and A. Zúquete, editors, Proceedings of CMS 2014, volume 8735 of Lecture Notes in Computer Science, pages 147--153. Springer, 2014. Extended abstract in conference proceedings.
  Get a preprint: 14-MPRS-qprivacy.pdf 
• O. Bournez, D. S. Graça, and A. Pouly. Turing machines can be efficiently simulated by the general purpose analog computer. In T-H. H. Chan, L. C. Lau, and L. Trevisan, editors, Proceedings of the 10th annual conference on Theory and Applications of Models of Computation (TAMC 2013), volume 7876 of Lecture Notes in Computer Science, pages 169--180. Springer-Verlag, 2013.
  Get a preprint: 13-BGP-Turing-GPAC.pdf 
• O. Bournez, D. S. Graça, A. Pouly, and N. Zhong. Computability and computational complexity of the evolution of nonlinear dynamical systems. In P. Bonizzoni, V. Brattka, and B. Löwe, editors, Proceedings of Computability in Europe: The nature of computation (CiE 2013), volume 7921 of Lecture Notes in Computer Science, pages 12--21. Springer-Verlag, 2013.
  Get a preprint: 13-BGPZ-CiE.pdf 
• F. Casal and J. Rasga. Revisiting the equivalence of shininess and politeness. In A. Middeldorp K. McMillan and A. Voronkov, editors, International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR-19), volume 8312 of Lecture Notes in Computer Science, pages 198--212. Springer-Verlag, 2013.
  Get a preprint: 13-CR-nelsonoppen.pdf 
• B. Conchinha, D. Basin, and C. Caleiro. Symbolic probabilistic analysis of off-line guessing. In K. Mayes, J. Crampton, and S. Jajodia, editors, European Symposium on Research in Computer Security (ESORICS 2013), volume 8134 of Lecture Notes in Computer Science, pages 363--380. Springer-Verlag, 2013.
  Get a preprint: 13-CBC-esoricsfull.pdf 
• F. Mota, S. Aaronson, L. Antunes, and A. Souto. Sophistication as randomness deficiency. In Rogério Jurgensen, Helmut; Reis, editor, Workshop on Descriptional Complexity of Formal Systems - DCFS, volume 8031 of Lecture Notes in Computer Science, pages 172--181. Springer-Verlag, July 2013.
  Get a preprint: 13-Dcfs-MALS-dcfsfull.pdf 
• L. Antunes, A. Souto, and A. Teixeira. Robustness of logical depth. In Anuj; Lowe Benedikt Cooper, Barry S.; Dawar, editor, Computability in Europe - CIE 2012, volume 7318 of Lecture Notes in Computer Science, pages 29--34. Springer-Verlag, June 2012.
  Get a preprint: 12-Cie-AST-ciefull.pdf 
• O. Bournez, D. S. Graça, and A. Pouly. Solving analytic differential equations in polynomial time over unbounded domains. In F. Murlak and P. Sankowski, editors, Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS 2011), volume 6907 of Lecture Notes in Computer Science, pages 170--181. Springer, 2011.
  Get a preprint: 11-BGP-analytic.pdf 
• B. Conchinha, D. Basin, and C. Caleiro. Efficient decision procedures for message deducibility and static equivalence. In P. Degano, S. Etale, and J. Guttman, editors, 7th International Workshop on Formal Aspects of Security and Trust, volume 6561 of Lecture Notes in Computer Science, pages 34--49. 2011.
  Get a preprint: 10-CBC-efficient.pdf 
• A. Souto. Kolmogorov complexity cores. In F. Ferreira, B. Lowe, E. Mayordomo, and L. Mendes Gomes, editors, Computability in Europe 2010, volume 6158 of Lecture Notes in Computer Science, pages 376--385. Springer-Verlag Berlin Heidelberg, 2010.
• P. Baltazar and P. Mateus. Temporalization of probabilistic propositional logic. In S. Artemov and A. Nerode, editors, Logic Foundations of Computer Science 2009, volume 5407 of Lecture Notes in Computer Science, pages 46--60. Springer, 2009.
  Get a preprint: 08-BM-qsec09s.pdf 
• C. Caleiro and R. Gonçalves. Algebraic valuations as behavioral logical matrices. In H. Ono e R. de Queiroz M. Kanazawa, editor, WoLLIC 2009, Selected Papers, volume 5514 of Lecture Notes in Artificial Intelligence, pages 13--25. Springer, 2009.
  Get a preprint: 09-CG-AlgValuations.pdf 
• C. Caleiro and J. Marcos. Classic-like analytic tableaux for finite-valued logics. In H. Ono e R. de Queiroz M. Kanazawa, editor, WoLLIC 2009, Selected Papers, volume 5514 of Lecture Notes in Artificial Intelligence, pages 268--280. Springer, 2009.
  Get a preprint: 09-CM-tableaux.pdf 
• D. S. Graça and N. Zhong. Computing domains of attraction for planar dynamics. In C. S. Calude, J. F. Costa, N. Dershowitz, E. Freire, and G. Rozenberg, editors, Proceedings of the 8th International Conference on Unconventional Computation (UC 2009), volume 5715 of Lecture Notes in Computer Science, pages 179--190. Springer, 2009.
  Get a preprint: 09-GZ-domain.pdf 
• C. Lourenço. Brain dynamics promotes function. In C.S. Calude, J. F. Costa, N. Dershowitz, and E. Freire, editors, Proceedings of the Unconventional Computation 8th International Conference - UC 2009, volume 5715 of Lecture Notes in Computer Science, pages 7--9. Springer, 2009.
  Get a preprint: 09-L-brain.pdf 
• P. Mateus and S. Vaudenay. On tamper-resistance from a theoretical point of view - the power of seals. In C. Clavier and K. Gaj, editors, Cryptographic Hardware and Embedded Systems (CHES'09), volume 5747 of Lecture Notes in Computer Science, pages 411--428. Springer, 2009.
  Get a preprint: 07-MV-qsec05.pdf 
• L. Cruz-Filipe, I. Lanese, F. Martins, A. Ravara, and V. Vasconcelos. Behavioural theory at work: program transformations in a service-centred calculus. In G. Barthe and F. de Boer, editors, Proceedings of the 10th IFIP International Conference on Formal Methods for Open Object-based Distributed Systems (FMOODS'08), Lecture Notes in Computer Science, pages 59--77. Springer, 2008.
  Get a preprint: 08-CLMRV-progtransf.pdf 
• C. Lourenço. EEG switching: three views from dynamical systems. In V. Kurková, R. Neruda, and J. Koutník, editors, Proceedings of the 18th International Conference in Artificial Neural Networks - ICANN 2008, volume 5164 of Lecture Notes in Computer Science, pages 665--674. Springer, 2008.
  Get a preprint: 08-L-switch.pdf 
• C. Caleiro and R. Gonçalves. On the algebraization of many-sorted logics. In J. Fiadeiro and P.-Y. Schobbens, editors, Recent Trends in Algebraic Development Techniques - Selected Papers, volume 4409 of Lecture Notes in Computer Science, pages 21--36. Springer, 2007.
  Get a preprint: 06-CG-manysorted.pdf 
• C. Caleiro and J. Ramos. Combining classical and intuitionistic implications. In B. Konev and F. Wolter, editors, Frontiers of Combining Systems 07, Lecture Notes in Artificial Intelligence, pages 118--132. Springer, 2007.
  Get a preprint: 07-CR-classint-imp.pdf 
• C. Lourenço. How can natural brains help us compute? In S.B. Cooper, B. Löwe, and A. Sorbi, editors, Computation and Logic in the Real World, Quaderni del Dipartimento di Scienze Matematiche e Informatiche Roberto Magari, pages 257--262. Universita di Siena, 2007.
  Get a preprint: 07-L-cie.pdf 
• P. Adão and C. Fournet. Cryptographically sound implementations for communicating processes. In M. Bugliese, B. Preneel, V. Sassone, and I. Wegener, editors, Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP'06), volume 4052 of Lecture Notes in Computer Science, pages 83--94. Springer, 2006.
  Get a preprint: 06-AF-implementations.ps  06-AF-implementations.pdf 
• M. Boreale, R. Bruni, L. Caires, R. de Nicola, I. Lanese, M. Loreti, F. Martins, U. Montanari, A. Ravara, D. Sangiorgi, V. Vasconcelos, and G. Zavattaro. SCC: a service centered calculus. In Mario Bravetti, Manuel Nú nez, and Gianluigi Zavattaro, editors, Proceedings of WS-FM 2006, 3rd International Workshop on Web Services and Formal Methods, volume 4184 of Lecture Notes in Computer Science, pages 38--57. Springer, 2006.
  Get a preprint: 06-sensoria-core-calculus.pdf 
• O. Bournez, M. L. Campagnolo, D. S. Graça, and E. Hainry. The General Purpose Analog Computer and Computable Analysis are two equivalent paradigms of analog computation. In J.-Y. Cai, S. B. Cooper, and A. Li, editors, Theory and Applications of Models of Computation TAMC'06, volume 3959 of Lecture Notes in Computer Science, pages 631--643. Springer, 2006.
  Get a preprint: 06-BCGH-tamc.pdf 
• C. Caleiro, P. Mateus, A. Sernadas, and C. Sernadas. Quantum institutions. In K. Futatsugi, J.-P. Jouannaud, and J. Meseguer, editors, Algebra, Meaning, and Computation -- Essays Dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday, volume 4060 of Lecture Notes in Computer Science, pages 50--64. Springer, 2006.
  Get a preprint: 05-CMSS-quantlog06.pdf 
• R. Chadha, P. Mateus, and A. Sernadas. Reasoning about states of probabilistic sequential programs. In Z. Ésik, editor, Computer Science Logic 2006 (CSL06), volume 4207 of Lecture Notes in Computer Science, pages 240--255. Springer, 2006.
  Get a preprint: 06-CMS-quantlog08s.pdf 
• J. Marcos. Ineffable inconsistencies. In J.-Y. Béziau and W. A. Carnielli, editors, Paraconsistency with no Frontiers, Proceedings of the III World Congress on Paraconsistency, held in Toulouse, FR, July 28-31, 2003, volume 4 of Studies in Logic and Practical Reasoning, pages 301--311. Elsevier Science, Amsterdam, 2006.
  Get a preprint: 04-M-ii.pdf 
• P. Mateus and Y. Omar. A quantum algorithm for closest pattern matching. In D. Angelakis, M. Christandl, A. Ekert, A. Kay, and S. Kulik, editors, Quantum Information Processing - From Theory to Experiment, volume 199 of NATO Science Series, III: Computer and Systems Sciences, pages 180--183. IOS Press, 2006. Short version of pmat:yo:05.
  Get a preprint: 05-MO-quantlog05s.pdf 
• P. Adão, G. Bana, J. Herzog, and A. Scedrov. Soundness of formal encryption in the presence of key-cycles. In S. De Capitani di Vimercati, P. Syverson, and D. Gollmann, editors, Proceedings of the 10th European Symposium on Research in Computer Security (ESORICS), volume 3679 of Lecture Notes in Computer Science, pages 374--396. Springer, 2005.
  Get a preprint: 05-ABHS-cycles.pdf 
• A. Almeida Matos. Non-disclosure for distributed mobile code. In R. Ramanujam and S. Sen, editors, Proceedings of the 25th International Conference: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2005), volume 3821 of Lecture Notes in Computer Science, pages 177--188. Springer, 2005.
  Get a preprint: 05-A-nondiscl+mobil-FSTTCS.pdf 
• C. Caleiro and J. Ramos. Cryptomorphisms at work. In J. Fiadeiro, P. Mosses, and F. Orejas, editors, Recent Trends in Algebraic Development Techniques - Selected Papers, volume 3423 of Lecture Notes in Computer Science, pages 45--60. Springer, 2005.
  Get a preprint: 04-CR-fiblog17.ps  04-CR-fiblog17.pdf 
• J. Cederquist, R. Corin, and M. Torabi Dashti. On the quest for impartiality: Design and analysis of a fair non-repudiation protocol. In S. Qing, W. Mao, J. Lopez, and G. Wang, editors, 7th International Conference on Information and Communications Security, volume 3783 of Lecture Notes in Computer Science, pages 27--39. Springer, 2005.
  Get a preprint: 05-CCT-nonrep.pdf 
• D. S. Graça, M. L. Campagnolo, and J. Buescu. Robust simulations of Turing machines with analytic maps and flows. In B. Cooper, B. Löwe, and L. Torenvliet, editors, Proceedings of CiE'05, New Computational Paradigms, volume 3526 of Lecture Notes in Computer Science, pages 169--179. Springer, 2005.
  Get a preprint: 05-GCB-stable.ps  05-GCB-stable.pdf 
• K. G. Roggia, M. A. Hoff, and P. B. Menezes. Computation of partial automata through span composition. In Roberto Moreno-Díaz, Franz Pichler, and Alexis Quesada-Arencibia, editors, EUROCAST'2005: 10th International Conference on Computer Aided Systems Theory and Technology, volume 3643 of Lecture Notes in Computer Science, pages 15--20. Springer, 2005.
  Get a preprint: 05-RHM-eurocast.pdf 
• F. van Breugel, C. Hermida, M. Makkai, and J. Worrel. An accessible approach to behavioural pseudo-metrics. In L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi, and M. Yung, editors, Automata, Languages and Programming ICALP'05, volume 3580 of Lecture Notes in Computer Science, pages 1018--1030. Springer, 2005.
• G. Barthe, J. Cederquist, and S. Tarento. A machine-checked formalization of the generic model and the random oracle model. In D. A. Basin and M. Rusinowitch, editors, 2nd International Joint Conference on Automated Reasoning (IJCAR'04), volume 3097 of Lecture Notes in Computer Science, pages 385--399. Springer, 2004.
  Get a preprint: 04-BCT-genericmodel.pdf 
• J. Cederquist and M. Torabi Dashti. Formal analysis of a fair payment protocol. In T. Dimitrakos and F. Martinelli, editors, 2nd International Workshop on Formal Aspect of Security and Trust, volume 173 of IFIP, pages 41--54. Kluwer Academic Publishers, Boston, Massachusetts, 2004.
  Get a preprint: 04-CT-fairpayment.pdf 
• L. Cruz-Filipe and F. Wiedijk. Hierarchical reflection. In K. Slind, A. Bunker, and G. Gopalakrishnan, editors, Theorem Proving in Higher Order Logics (17th International Conference, TPHOLs 2004), volume 3223 of Lecture Notes in Computer Science, pages 66--81. Springer, 2004.
  Get a preprint: 04-CW-hrefl.ps  04-CW-hrefl.pdf 
• L. Cruz-Filipe, H. Geuvers, and F. Wiedijk. C-CoRN, the Constructive Coq Repository at Nijmegen. In A. Asperti, G. Bancerek, and A. Trybulec, editors, Mathematical Knowledge Management, volume 3119 of Lecture Notes in Computer Science, pages 88--103. Springer, 2004.
  Get a preprint: 04-CGW-ccorn.ps  04-CGW-ccorn.pdf 
• C. Hermida. Fibrations for abstract multicategories. In G. Janelidze, B. Pareigis, and W. Tholen, editors, Galois theory, Hopf algebras, and semiabelian categories, volume 43 of Fields Institute Communications, pages 281--293. American Mathemathical Society, 2004.
  Get a preprint: fib-mul.pdf 
• P. Mateus and A. Sernadas. Reasoning about quantum systems. In J. Alferes and J. Leite, editors, Logics in Artificial Intelligence, Ninth European Conference, JELIA'04, volume 3229 of Lecture Notes in Artificial Intelligence, pages 239--251. Springer, 2004.
  Get a preprint: 04-MS-fiblog24x.ps  04-MS-fiblog24x.pdf 
• V. T. Vasconcelos, A. Ravara, and S. Gay. Session types for functional multithreading. In 15th International Conference on Concurrency Theory, volume 3170 of Lecture Notes in Computer Science, pages 497--511. Springer, 2004. Short version of vv:amar:gay:04b.
  Get a preprint: 04-VRG-sessions.pdf 
• C. Caleiro, P. Gouveia, and J. Ramos. Completeness results for fibred parchments: Beyond the propositional base. In M. Wirsing, D. Pattinson, and R. Hennicker, editors, Recent Trends in Algebraic Development Techniques - Selected Papers, volume 2755 of Lecture Notes in Computer Science, pages 185--200. Springer, 2003.
  Get a preprint: 03-CGR-fiblog16.ps  03-CGR-fiblog16.pdf 
• L. Cruz-Filipe. A constructive formalization of the fundamental theorem of calculus. In H. Geuvers and F. Wiedijk, editors, Types for Proofs and Programs (TYPES 2002), volume 2646 of Lecture Notes in Computer Science, pages 108--126. Springer, 2003.
  Get a preprint: 02-C-ftcalculus.ps 
• L. Cruz-Filipe and B. Spitters. Program extraction from large proof developments. In D. Basin and B. Wolff, editors, Theorem Proving in Higher Order Logics (16th International Conference, TPHOLs 2003), volume 2758 of Lecture Notes in Computer Science, pages 205--220. Springer, 2003.
  Get a preprint: 03-CS-extraction.ps 
• P. Mateus, J. Mitchell, and A. Scedrov. Composition of cryptographic protocols in a probabilistic polynomial-time process calculus. In R. Amadio and D. Lugiez, editors, CONCUR 2003 - Concurrency Theory, volume 2761 of Lecture Notes in Computer Science, pages 327--349. Springer, 2003.
  Get a preprint: 03-MMS-seccomp.ps  03-MMS-seccomp.pdf 
• M. L. Campagnolo. The complexity of real recursive functions. In C.S. Calude, M.J. Dinneen, and F. Peper, editors, Unconventional Models of Computation (UMC 2002), volume 2509 of Lecture Notes in Computer Science, pages 1--14. Springer, 2002.
  Get a preprint: 02-C-realrec.pdf 
• W. A. Carnielli and J. Marcos. A taxonomy of C-systems. In W. A. Carnielli, M. E. Coniglio, and I. M. L. D'Ottaviano, editors, Paraconsistency: The logical way to the inconsistent, volume 228 of Lecture Notes in Pure and Applied Mathematics, pages 1--94. Marcel Dekker, 2002.
  Get a preprint: 02-CM-taxonomy.pdf 
• S. de Amo, W. A. Carnielli, and J. Marcos. A logical framework for integrating inconsistent information in multiple databases. In Proceedings of the II International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2002), Schloss Salzau, DE, 19-23 February 2002, volume 2284 of Lecture Notes in Computer Science, pages 67--84. Springer, Berlin, 2002.
  Get a preprint: 03-dACM-FoIKS02.pdf 
• J. Rasga, A. Sernadas, C. Sernadas, and L. Viganò. Labelled deduction over algebras of truth values. In A. Armando, editor, Frontiers of Combining Systems 4, volume 2309 of Lecture Notes in Artificial Intelligence, pages 222--238. Springer, 2002.
  Get a preprint: 01-RSSV-fiblog11s.ps  01-RSSV-fiblog11s.pdf 
• C. Caleiro, P. Mateus, J. Ramos, and A. Sernadas. Combining logics: Parchments revisited. In M. Cerioli and G. Reggio, editors, Recent Trends in Algebraic Development Techniques - Selected Papers, volume 2267 of Lecture Notes in Computer Science, pages 48--70. Springer, 2001.
  Get a preprint: 01-CMRS-fiblog9.ps  01-CMRS-fiblog9.pdf 
• P. Gouveia and C. Sernadas. Abductive reasoning over temporal specifications of objects. In M. Zakharyaschev, K. Segerberg, M. de Rijke, and H. Wansing, editors, Advances in Modal Logic 2, volume 119 of CSLI Lecture Notes, pages 275--300. CSLI Publications, 2001.
  Get a preprint: 98-GS-artso.ps 
• J. Cederquist and T. Coquand. Entailment relations and distributive lattices. In S. R. Buss, P. Hájek, and P. Pudlák, editors, Logic Colloquium 1998, Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, volume 13 of Lecture Notes in Logic, pages 127--139. Association for Symbolic Logic, Ltd, Natick, Massachusetts, 2000.
  Get a preprint: 00-CC-entailment.ps  00-CC-entailment.pdf 
• H. Lourenço and A. Sernadas. An institution of hybrid systems. In Didier Bert and Christine Choppy, editors, Recent Trends in Algebraic Development Techniques - Selected Papers, volume 1827 of Lecture Notes in Computer Science, pages 219--236. Springer, 2000.
  Get a preprint: 99-LS-hybint.ps 
• P. Mateus, A. Sernadas, and C. Sernadas. Realization of probabilistic automata: Categorical approach. In Didier Bert and Christine Choppy, editors, Recent Trends in Algebraic Development Techniques - Selected Papers, volume 1827 of Lecture Notes in Computer Science, pages 237--251. Springer, 2000.
  Get a preprint: 99-MSS-probreal.ps  99-MSS-probreal.pdf 
• A. Ravara and V. Vasconcelos. Typing non-uniform concurrent objects. In C. Palamidessi, editor, CONCUR'00, volume 1877 of Lecture Notes in Computer Science, pages 474--488. Springer, 2000. Short version of amar:vv:00b.
  Get a preprint: 99-RV-tco.ps 
• C. Caleiro, C. Sernadas, and A. Sernadas. Parameterisation of logics. In J. Fiadeiro, editor, Recent Trends in Algebraic Development Techniques - Selected Papers, volume 1589 of Lecture Notes in Computer Science, pages 48--62. Springer, 1999.
  Get a preprint: 98-CSS-paramlog.ps 
• U. Nestmann and A. Ravara. Semantics of objects as processes (SOAP). In Object-Oriented Technology -- ECOOP'99 Workshop Reader, volume 1743 of Lecture Notes in Computer Science, pages 314--325. Springer, 1999. An introduction to, and summary of, the 2nd International SOAP Workshop.
• J. Ramos and A. Sernadas. The situation and state calculus versus branching temporal logic. In J. Fiadeiro, editor, Recent Trends in Algebraic Development Techniques - Selected Papers, volume 1589 of Lecture Notes in Computer Science, pages 293--309. Springer, 1999.
  Get a preprint: 98-RS-sscbtl.ps 
• J. Cederquist. An implementation of the heine-borel covering theorem in type theory. In Eduardo Giménez and Christine Paulin-Mohring, editors, TYPES '96: Selected papers from the International Workshop on Types for Proofs and Programs, volume 1512 of Lecture Notes in Computer Science, pages 46--65. Springer, 1998.
  Get a preprint: 98-C-heineborel.ps  98-C-heineborel.pdf 
• F. M. Dionísio and U. Lipeck. Specifying with defaults: Compositional semantics. In Francesco Parisi Presicce, editor, Recent Trends in Data Type Specification, volume 1376 of Lecture Notes in Computer Science, pages 206--222. Springer, 1998.
  Get a preprint: 97-DL-SDCS.ps 
• G. Denker, J. Ramos, C. Caleiro, and A. Sernadas. A linear temporal logic approach to objects with transactions. In M. Johnson, editor, Algebraic Methodology and Software Technology, volume 1349 of Lecture Notes in Computer Science, pages 170--184. Springer, 1997.
  Get a preprint: 97-DRCS-tosl.ps 
• A. Ravara and V. Vasconcelos. Behavioural types for a calculus of concurrent objects. In C. Lengauer, M. Griebl, and S. Gorlatch, editors, 3rd International Euro-Par Conference, volume 1300 of Lecture Notes in Computer Science, pages 554--561. Springer, 1997. Full version available as DM-IST Research Report 06/97.
  Get a preprint: 97-RV-short_bevtypes.ps 
• A. Sernadas, C. Sernadas, and C. Caleiro. Synchronization of logics with mixed rules: Completeness preservation. In M. Johnson, editor, Algebraic Methodology and Software Technology, volume 1349 of Lecture Notes in Computer Science, pages 465--478. Springer, 1997.
  Get a preprint: 97-SSC-synclogII.ps 
• P. B. Menezes, J. F. Costa, and A. Sernadas. Refinement mapping for (discrete event) system theory. In F. Pichler, R. Moreno Diaz, and R. Albrecht, editors, Computer Aided System Technology, EUROCAST'95, volume 1030 of Lecture Notes in Computer Science, pages 103--116. Springer, 1996.
• M. L. Campagnolo, H. Coelho, and J. Capelo. Knowledge based clustering of partially characterized objects. In J. Wainer and A. Carvalho, editors, Advances in Artificial Intelligence, volume 991 of Lecture Notes in Artificial Intelligence, pages 161--170. Springer, 1995.
• J. Cederquist and S. Negri. A constructive proof of the heine-borel covering theorem for formal reals. In S. Berardi and M. Coppo, editors, 3rd Int. Workshop on Types for Proofs and Programs (TYPES), volume 1158 of Lecture Notes in Computer Science, pages 62--75. Springer, 1995.
  Get a preprint: 95-CN-heineborel.ps  95-CN-heineborel.pdf 
• H.-D. Ehrich and A. Sernadas. Local specification of distributed families of sequential objects. In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data Type Specification, volume 906 of Lecture Notes in Computer Science, pages 219--235. Springer, 1995.
  Get a preprint: 95-ES-dfso.ps 
• C. Hermida and B. Jacobs. An algebraic view of structural induction. In L. Pacholski and J. Tiuryn, editors, Proceedings CSL'94, Computer Science Logic, volume 933 of Lecture Notes in Computer Science, pages 412--426. Springer, May 1995.
• C. Hermida and J. Power. Fibrational control structures. In I. Lee and S. Smolka, editors, Proceedings CONCUR'95: Concurrency Theory, volume 962 of Lecture Notes in Computer Science, pages 117--129. Springer, August 1995.
• A. Sernadas, C. Sernadas, and J. Valença. A theory-based, topological notion of institution. In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data Type Specification, volume 906 of Lecture Notes in Computer Science, pages 420--436. Springer, 1995.
  Get a preprint: 94-SSV-stopi.ps 
• C. Hermida. On fibred adjunctions and completeness for fibred categories. In 9th WADT- 4th Compass Workshop, volume 785 of Lecture Notes in Computer Science, pages 235--251. Springer, 1994.
• A. Sernadas, J. F. Costa, and C. Sernadas. An institution of object behaviour. In H. Ehrig and F. Orejas, editors, Recent Trends in Data Type Specification, volume 785 of Lecture Notes in Computer Science, pages 337--350. Springer, 1994.
  Get a preprint: 94-SCS-iob.ps 
• J. F. Costa, A. Sernadas, and C. Sernadas. Data encapsulation and modularity: Three views of inheritance. In A. Borzyszkowski and S. Sokolowski, editors, Mathematical Foundations of Computer Science 93, volume 711 of Lecture Notes in Computer Science, pages 382--391. Springer, 1993.
  Get a preprint: 93-CSS-3views.ps 
• H.-D. Ehrich, G. Denker, and A. Sernadas. Constructing systems as object communities. In M.C. Gaudel and J.-P. Jouannaud, editors, TAPSOFT 93: Theory and Practice of Software Development, volume 668 of Lecture Notes in Computer Science, pages 453--467. Springer, 1993.
  Get a preprint: 93-EDS-construct.ps 
• H.-D. Ehrich, M. Gogolla, and A. Sernadas. Objects and their specification. In M. Bidoit and C. Choppy, editors, Recent Trends in Data Type Specification: 8th Workshop on Specification of Abstract Data Types - Selected Papers, volume 655 of Lecture Notes in Computer Science, pages 40--65. Springer, 1993.
• J. Fiadeiro, J. F. Costa, A. Sernadas, and T. Maibaum. Process semantics of temporal logic specification. In M. Bidoit and C. Choppy, editors, Recent Trends in Data Type Specification: 8th Workshop on Specification of Abstract Data Types - Selected Papers, volume 655 of Lecture Notes in Computer Science, pages 236--253. Springer, 1993.
• J. F. Costa, A. Sernadas, C. Sernadas, and H.-D. Ehrich. Object interaction. In I. Havel and V. Koubek, editors, Mathematical Foundations of Computer Science 92, volume 629 of Lecture Notes in Computer Science, pages 200--208. Springer, 1992.
  Get a preprint: 92-CSSE-obint.ps 
• H.-D. Ehrich, J. Goguen, and A. Sernadas. A categorial theory of objects as observed processes. In J. de Bakker, W.-P de Roever, and G. Rozenberg, editors, Foundations of Object-Oriented Languages, volume 489 of Lecture Notes in Computer Science, pages 203--228. Springer, 1991.
  Get a preprint: 91-EGS-REX.pdf 
• R. Jungclaus, G. Saake, and C. Sernadas. Formal specification of object systems. In S. Abramski and T. Maibaum, editors, TAPSOFT 91: Theory and Practice of Software Development, volume 494 of Lecture Notes in Computer Science, pages 60--82. Springer, 1991.
  Get a preprint: 91-JSS-formal-spec.ps 
• G. Saake, R. Jungclaus, and C. Sernadas. Abstract data type semantics for many-sorted object query algebra. In B. Thalheim, J. Demetrovics, and H.-B. Gerhardt, editors, Mathematical Foundations of Data Base Systems, volume 495 of Lecture Notes in Computer Science, pages 291--307. Springer, 1991.
  Get a preprint: 91-SJS-adt.ps 
• H.-D. Ehrich and A. Sernadas. Algebraic implementation of objects over objects. In J. de Bakker, W.-P de Roever, and G. Rozenberg, editors, Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, volume 430 of Lecture Notes in Computer Science, pages 239--266. Springer, 1990.
• J. Carmo and A. Sernadas. Inevitability in branching time. In A. Meyer and M. Taitshin, editors, Logic at Botik 89, volume 363 of Lecture Notes in Computer Science, pages 41--62. Springer, 1989.
• H.-D. Ehrich, A. Sernadas, and C. Sernadas. Objects, object types and object identity. In H. Ehrig et al, editor, Categorical Methods in Computer Science with Aspects from Topology, volume 393 of Lecture Notes in Computer Science, pages 142--156. Springer, 1989.
• A. Sernadas, J. Fiadeiro, C. Sernadas, and H.-D. Ehrich. Abstract object types: A temporal perspective. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Temporal Logic in Specification, volume 398 of Lecture Notes in Computer Science, pages 324--350. Springer, 1989.
• J. Fiadeiro and A. Sernadas. Structuring theories on consequence. In D. Sannella and A. Tarlecki, editors, Recent Trends in Data Type Specification: 5th Workshop on Specification of Abstract Data Types - Selected Papers, volume 332 of Lecture Notes in Computer Science, pages 44--72. Springer, 1988.
• J. Fiadeiro, A. Sernadas, and C. Sernadas. Knowledgebases as structured theories. In K. Nori and S. Kumar, editors, Foundations of Software Technology and Theoretical Computer Science, volume 338 of Lecture Notes in Computer Science, pages 469--486. Springer, 1988.
• M. Volpe, J. Marcos, and C. Caleiro. Classic-like cut-based tableau systems for finite-valued logics. In L. Ong and R. de Queiroz, editors, WoLLIC 2012, Selected Papers, volume 7456 of Lecture Notes in Computer Science, pages 321--335. Springer, 2012.
  Get a preprint: 12-VMC-cutbased.pdf