References

[1]

P. Adão. Electronic money within My-calculus. Technical report, CLC, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2002. Diploma thesis. Supervised by P. Mateus.

[2]

P. Adão. Formal Methods for the Analysis of Security Protocols. PhD thesis, IST, Universidade Técnica de Lisboa, 2006. Supervised by P. Mateus and A. Scedrov.

[3]

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-Verlag, 2005.

[4]

P. Adão, G. Bana, J. Herzog, and A. Scedrov. Soundness and completeness of formal encryption: the cases of key-cycles and partial information leakage. Journal of Computer Security, in print.

[5]

P. Adão, G. Bana, and A. Scedrov. Computational and information-theoretic soundness and completeness of formal encryption. In Proceedings of the 18th IEEE Computer Security Foundations Workshop (CSFW), pages 170-184, Aix-en-Provence, France, June 20-22, 2005. IEEE Computer Society Press.

[6]

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-Verlag, 2006.

[7]

P. Adão and C. Fournet. Language design for computationally sound communications abstractions. Technical report, CLC, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2006. Extended abstract. Presented at the 2nd Workshop on Formal and Computational Cryptography (FCC). Affiliated Workshop of ICALP'06, July 9, Venice, Italy.

[8]

P. Adão and P. Mateus. A process algebra for reasoning about quantum security. Electronic Notes in Theoretical Computer Science, 170:3-21, 2007. Preliminary version presented at 3rd International Workshop on Quantum Programming Languages, June 30 - July 1, 2005, Chicago, Affiliated Workshop of LICS 2005.

[9]

P. Adão, P. Mateus, T. Reis, and L. Viganò. Towards a quantitative analysis of security protocols. Electronic Notes in Theoretical Computer Science, 164(3):3-25, 2006.

[10]

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-Verlag, 2005.

[11]

A. Almeida Matos. Typing secure information flow: declassification and mobility. PhD thesis, École Nationale Supérieure des Mines de Paris, 2006. Supervised by G. Boudol and I. Castellani.

[12]

A. Almeida Matos and G. Boudol. On declassification and the non-disclosure policy. In Proceedings of the 18th IEEE Computer Security Foundations Workshop (CSFW'05), pages 226-240. IEEE Computer Society, 2005.

[13]

A. Almeida Matos and G. Boudol. On declassification and the non-disclosure policy. Journal of Computer Security, in print.

[14]

A. Almeida Matos, G. Boudol, and I. Castellani. Typing noninterference for reactive programs. In A. Sabelfield, editor, Proceedings of the Workshop on Foundations of Computer Security, volume 31, pages 205-221. Turku Center for Computer Science, 2004.

[15]

A. Almeida Matos, G. Boudol, and I. Castellani. Typing noninterference for reactive programs. Technical Report RR-5594, Institut National de Recherche en Informatique et en Automatique (INRIA), 06902 Sophia Antipolis, France, 2005.

[16]

A. Almeida Matos, G. Boudol, and I. Castellani. Typing noninterference for reactive programs. Journal of Logic and Algebraic Programming, 72(2):124-156, 2007. Special Issue on Programming Language Interference and Dependence.

[17]

M. Alves and C. Lourenço. Selenoprotein discovery using neural networks. In N. Guimarães and P. Isaías, editors, Proceedings of the International Conference on Applied Computing (IADIS'05), pages 519-526, Algarve, Portugal, February 22-25, 2005.

[18]

L. Andrade and A. Sernadas. Banking and management information system automation. In J. Gertler, J. Cruz, and M. Peshkin, editors, Proc. 13th World Congress of International Federation of Automatic Control, pages 133-138. IFAC, 1996.

[19]

A. Babloyantz and C. Lourenço. Computation with chaos: A paradigm for cortical activity. Proceedings of the National Academy of Sciences U.S.A., 91:9027-9031, 1994.

[20]

A. Babloyantz and C. Lourenço. Brain chaos and computation. International Journal of Neural Systems, 7:461-471, 1996.

[21]

A. Babloyantz, C. Lourenço, and J.-A. Sepulchre. Control of chaos in delay differential equations, in a network of oscillators and in model cortex. Physica D, 86:274-283, 1995.

[22]

P. Baltazar. Variedades M-sólidas de linguagens. Master's thesis, FCUL, Universidade de Lisboa, 2005. Supervised by M. Ramalho.

[23]

P. Baltazar. M-solid varieties of languages. Acta Cybernetica, 18(4):719-731, 2008.

[24]

P. Baltazar. Topic: Model Checking of Quantum Systems. PhD thesis, IST, Universidade Técnica de Lisboa, in preparation. Expected submission: 2008. Supervised by P. Mateus.

[25]

P. Baltazar, R. Chadha, and P. Mateus. Quantum computation tree logic - model checking and complete calculus. International Journal of Quantum Information, 6(2):281-302, 2008.

[26]

P. Baltazar, R. Chadha, P. Mateus, and A. Sernadas. Towards model-checking quantum security protocols. In P. Dini et al, editor, Proceedings of the First Workshop on Quantum Security: QSec'07, page 0014. IEEE Press, 2007. Joint e-proceedings with Quantum, Nano, and Micro Technologies: ICQNM '07. 6 pages.

[27]

P. Baltazar and P. Mateus. Verifying probabilistic systems with EpCTL. Preprint, SQIG - IT and IST - TU Lisbon, 1049-001 Lisboa, Portugal, 2008. Submitted for publication.

[28]

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.

[29]

P. Baltazar, P. Mateus, R. Nagarajan, and N. Papanikolaou. Exogenous probabilistic computation tree logic. Electronic Notes in Theoretical Computer Science, 190(3):95-110, 2007.

[30]

P. Baltazar, J. Ramos, and C. Sernadas. Probability and quantum institutions revisited. Preprint, CLC, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2006. Presented at WADT'06, La Roche en Ardenne, Belgium, June 1-3, 2006.

[31]

P. Barcia, M. N. Bugalho, M. L. Campagnolo, and J. O. Cerdeira. Using N-alkanes to estimate diet composition of herbivores: a novel mathematical approach. Animal, 1:141-149, 2007.

[32]

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-Verlag, 2004.

[33]

D. Basin, C. Caleiro, J. Ramos, and L. Viganò. Labeled tableaux for distributed temporal logic. In Proceedings of the 15th Intl.Symp. on Temporal Representation and Reasoning (TIME 2008), pages 101-109. IEEE Computer Society Press, 2008.

[34]

K. Böhm. Real-time object specification logic. Technical report, University of Darmstadt, 1993. Diploma thesis. Supervised by A. Sernadas.

[35]

K. Böhm and A. Sernadas. Real-time object specification logic. In A. Olivé, editor, The Deductive Approach to Information Systems and Databases 93, pages 159-174. Universitat Politècnica de Catalunya, 1993.

[36]

K. Böhm and A. Sernadas. A logic to specify real-time object behaviour. In A. Verbraeck, H. Sol, and P. Bots, editors, Proceedings of the Fourth International Working Conference on Dynamic Modelling and Information Systems, pages 53-69. Delft University Press, 1994.

[37]

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úñez, 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-Verlag, 2006.

[38]

S. Bose, A. Ekert, Y. Omar, N. Paunkovic, and V. Vedral. Optimal state discrimination using particle statistics. Physical Review A, 68:052309, 2003. ArXiv quant-ph/0309090.

[39]

J. Bouda, P. Mateus, N. Paunkovic, and J. Rasga. On the power of quantum tamper-proof hardware. International Journal of Quantum Information, 6(2):219-236, 2008.

[40]

O. Bournez and M. L. Campagnolo. A survey on continuous time computations. In S.B. Cooper, B. Löwe, and A. Sorbi, editors, New Computational Paradigms: Changing Conceptions of What is Computable, pages 383-423. Springer-Verlag, 2008.

[41]

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-Verlag, 2006.

[42]

O. Bournez, M. L. Campagnolo, D. S. Graça, and E. Hainry. Polynomial differential equations compute all real computable functions on computable compact intervals. Journal of Complexity, 23:317-335, 2007.

[43]

V. Bozin, M. Hruska, N. Paunkovic, and F. Herbut. On statistical and deterministic quantum teleportation. Journal of Physics A, 31:4403, 1998.

[44]

C. Brukner, N. Paunkovic, T. Rudolph, and V. Vedral. Entanglement-assisted orientation in space. International Journal of Quantum Information, 4(2):365-370, 2006. ArXiv quant-ph/0509123.

[45]

J. Bueno-Soler. Semântica algébrica de traduções possíveis (Possible-translations algebraic semantics). Master's thesis, IFCH, Universidade Estadual de Campinas, 2004. Supervised by M. E. Coniglio and C. Caleiro.

[46]

C. Caleiro. Operational semantics of temporal object specification. INESC Journal on Junior Activities in Science and Technology, 1(1):7-35, 1994.

[47]

C. Caleiro. On the relationship between operational and denotational semantics of temporal logic specification of object behaviour. In R. Wieringa and R. Feenstra, editors, IS-CORE'94 - Selected papers, pages 69-83. World Scientific Publishers, 1995.

[48]

C. Caleiro. Comunidades distribuídas de objectos (Distributed object communities). Master's thesis, IST, Universidade Técnica de Lisboa, 1996. Supervised by A. Sernadas.

[49]

C. Caleiro. Combining Logics. PhD thesis, IST, Universidade Técnica de Lisboa, 2000. Supervised by A. Sernadas.

[50]

C. Caleiro, W. A. Carnielli, M. E. Coniglio, and J. Marcos. Dyadic semantics for many-valued logics. Research report, CLC, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2003. Presented at III World Congress on Paraconsistency, Toulouse, France, July 28-31, 2003.

[51]

C. Caleiro, W. A. Carnielli, M. E. Coniglio, and J. Marcos. Suszko's Thesis and dyadic semantics. Research report, CLC, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2003. Presented at III World Congress on Paraconsistency, Toulouse, France, July 28-31, 2003.

[52]

C. Caleiro, W. A. Carnielli, M. E. Coniglio, and J. Marcos. Two's company: "The humbug of many logical values". In J.-Y. Béziau, editor, Logica Universalis, pages 169-189. Birkhäuser Verlag, 2005.

[53]

C. Caleiro, W. A. Carnielli, M. E. Coniglio, A. Sernadas, and C. Sernadas. Fibring non-truth-functional logics: Completeness preservation. Journal of Logic, Language and Information, 12(2):183-211, 2003.

[54]

C. Caleiro, W. A. Carnielli, J. Rasga, and C. Sernadas. Fibring of logics as a universal construction. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, 2nd Edition, volume 13, pages 123-187. Springer, 2005.

[55]

C. Caleiro and R. Gonçalves. Equipollent logical systems. In J.-Y. Béziau, editor, Logica Universalis, pages 99-112. Birkhäuser Verlag, 2005.

[56]

C. Caleiro and R. Gonçalves. On the algebraization of valuation semantics. Preprint, CLC, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2005. Presented at 1st World Congress on Universal Logic, Montreux, Switzerland, March 31 - April 3, 2005. Extended abstract.

[57]

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-Verlag, 2007.

[58]

C. Caleiro and R. Gonçalves. An algebraic perspective on valuation semantics. Preprint, SQIG - IT and IST - TU Lisbon, 1049-001 Lisboa, Portugal, 2008. Submitted for publication.

[59]

C. Caleiro and R. Gonçalves. Behavioral algebraization of da costa's C-systems. Preprint, SQIG - IT and IST - TU Lisbon, 1049-001 Lisboa, Portugal, 2008. Submitted for publication.

[60]

C. Caleiro and R. Gonçalves. An algebraic perspective on valuation semantics (abstract). To be published in the Bulletin of Symbolic Logic, in print.

[61]

C. Caleiro and R. Gonçalves. Behavioral algebraization of the C_n systems of da Costa (abstract). To be published in the Bulletin of Symbolic Logic, in print.

[62]

C. Caleiro, R. Gonçalves, and M. Martins. Behavioral algebraization of logics. Studia Logica, in print.

[63]

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-Verlag, 2003.

[64]

C. Caleiro, P. Gouveia, and J. Ramos. Hierarchical logical consequence. Preprint, SQIG - IT and IST - TU Lisbon, 1049-001 Lisboa, Portugal, 2007. Submitted for publication.

[65]

C. Caleiro and J. Marcos. Non-truth-functional fibred semantics. In H. R. Arabnia, editor, Proceedings of the International Conference on Artificial Intelligence (IC-AI'2001), volume II, pages 841-847. CSREA Press, Athens GA, USA, 2001.

[66]

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-Verlag, 2001.

[67]

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-Verlag, 2006.

[68]

C. Caleiro and J. Ramos. Cryptofibring. In W. A. Carnielli, F. M. Dionísio, and P. Mateus, editors, Proceedings of CombLog'04, Workshop on Combination of Logics: Theory and Applications, pages 87-92, 1049-001 Lisboa, Portugal, 2004. Departamento de Matemática, Instituto Superior Técnico. Extended abstract.

[69]

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-Verlag, 2005.

[70]

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.

[71]

C. Caleiro and J. Ramos. From fibring to cryptofibring: a solution to the collapsing problem. Logica Universalis, 1(1):71-92, 2007.

[72]

C. Caleiro, G. Saake, and A. Sernadas. Deriving liveness goals from temporal logic specifications. Journal of Symbolic Computation, 22:521-553, 1996.

[73]

C. Caleiro, A. Sernadas, and C. Sernadas. Fibring logics: Past, present and future. In S. Artemov, H. Barringer, A. S. d'Avila Garcez, L. C. Lamb, and J. Woods, editors, We Will Show Them: Essays in Honour of Dov Gabbay, Volume One, pages 363-388. King's College Publications, 2005.

[74]

C. Caleiro, C. Sernadas, and A. Sernadas. Mechanisms for combining logics. Research report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 1999.

[75]

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-Verlag, 1999.

[76]

C. Caleiro, L. Viganò, and D. Basin. Towards a metalogic for security protocol analysis. In W. A. Carnielli, F. M. Dionísio, and P. Mateus, editors, Proceedings of CombLog'04, Workshop on Combination of Logics: Theory and Applications, pages 187-196, 1049-001 Lisboa, Portugal, 2004. Departamento de Matemática, Instituto Superior Técnico. Extended abstract.

[77]

C. Caleiro, L. Viganò, and D. Basin. Deconstructing Alice and Bob. Electronic Notes in Theoretical Computer Science, 135(1):3-22, 2005. Preliminary version presented at ICALP'05 ARSPA Workshop.

[78]

C. Caleiro, L. Viganò, and D. Basin. Metareasoning about security protocols using distributed temporal logic. Electronic Notes in Theoretical Computer Science, 125(1):67-89, 2005. Preliminary version presented at IJCAR'04 ARSPA Workshop.

[79]

C. Caleiro, L. Viganò, and D. Basin. Relating strand spaces and distributed temporal logic for security protocol analysis. Logic Journal of the IGPL, 13(6):637-664, 2005.

[80]

C. Caleiro, L. Viganò, and D. Basin. On the semantics of Alice&Bob specifications of security protocols. Theoretical Computer Science, 367(1-2):88-122, 2006.

[81]

L. Camacho. Topic: Colorings of Knots versus Polynomial Invariants. PhD thesis, Universidade da Madeira, in preparation. Expected submission: 2008. Supervised by F. M. Dionísio and P. Lopes.

[82]

M. L. Campagnolo. Proposta de um método para a integração de conhecimento em classificação (Proposal of a method for integrating knowledge in classification). Master's thesis, ISEG, Universidade Técnica de Lisboa, 1992. Supervised by H. Coelho.

[83]

M. L. Campagnolo. Computational Complexity of Real Valued Recursive Functions and Analog Circuits. PhD thesis, IST, Universidade Técnica de Lisboa, 2001. Supervised by J. F. Costa and C. Moore.

[84]

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-Verlag, 2002.

[85]

M. L. Campagnolo. Continuous time computation with restricted integration capabilities. Theoretical Computer Science, 317:147-165, 2004.

[86]

M. L. Campagnolo and M. Caetano. Expert maps: an alternative for integrating expert knowledge in satellite imagery classification. In T. I. Stein, editor, Proceedings of the 1997 International Geoscience and Remote Sensing Symposium, volume 2, pages 680-682. IEEE, 1997.

[87]

M. L. Campagnolo and J. O. Cerdeira. Contextual classification of remotely sensed images with integer linear programming. In Proceedings of CompIMAGE - Computational Modelling of Objects Represented in Images: Fundamentals, Methods and Applications, pages 123-128. Taylor and Francis, 2007.

[88]

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-Verlag, 1995.

[89]

M. L. Campagnolo and J. F. Costa. From recursive to R-recursive functions. Research report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 1997.

[90]

M. L. Campagnolo and C. Moore. Upper and lower bounds on continuous-time computation. In I. Antoniou, C. Calude, and M. Dinneen, editors, 2nd International Conference on Unconventional Models of Computation - UMC'2K, pages 135-153. Springer-Verlag, 2001.

[91]

M. L. Campagnolo, C. Moore, and J. F. Costa. Analog computers and the iteration functional. Research Report TR-98-10, FCUL, 1700 Lisboa, Portugal, 1998.

[92]

M. L. Campagnolo, C. Moore, and J. F. Costa. An analog characterization of the subrecursive functions. In P. Kornerup, editor, Proc. 4th Conference on Real Numbers and Computers, pages 91-109. Odense University Press, 2000.

[93]

M. L. Campagnolo, C. Moore, and J. F. Costa. Iteration, inequalities, and differentiability in analog computers. Journal of Complexity, 16(4):642-660, 2000.

[94]

M. L. Campagnolo, C. Moore, and J. F. Costa. An analog characterization of the Grzegorczyk hierarchy. Journal of Complexity, 18(4):977-1000, 2002.

[95]

M. L. Campagnolo and K. Ojakian. The methods of approximation and lifting in real computation. Electronic Notes in Theoretical Computer Science, 167:387-423, 2007. Preliminary version presented at the Third International Conference on Computability and Complexity.

[96]

M. L. Campagnolo and K. Ojakian. The elementary computable functions over the real numbers: Applying two new techniques. Archive for Mathematical Logic, 46(7-8):593-627, 2008.

[97]

M. L. Campagnolo and K. Ojakian. Characterizing computable analysis with differential equations. Electronic Notes in Theoretical Computer Science, in print. Presented at the Fifth International Conference on Computability and Complexity in Analysis (CCA 2008).

[98]

R. Carapuça, L. Andrade, and A. Sernadas. A database design and construction workbench. In T. Olle, A. Verrijn-Stuart, and L. Bhabuta, editors, Computerized Assistance During the Information Systems Life Cycle, pages 261-286. North-Holland, 1988.

[99]

R. Carapuça. Representação em Bases de Dados de Bases de Conhecimento (Database Implementation of Knowledge Bases). PhD thesis, IST, Universidade Técnica de Lisboa, 1988. Supervised by A. Sernadas.

[100]

J. Carmo. Lógicas Temporais para a Especificação e Verificação de Sistemas de Informação (Temporal Logics for Systems Specification and Verification). PhD thesis, IST, Universidade Técnica de Lisboa, 1988. Supervised by A. Sernadas.

[101]

J. Carmo and A. Sernadas. A temporal logic framework for a layered approach to systems specification and verification. In C. Rolland, F. Bodart, and M. Leonard, editors, Temporal Aspects in Information Systems, pages 31-46. North-Holland, 1988.

[102]

J. Carmo and A. Sernadas. A completeness result in a mixed branching-linear logic. Technical report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, 1989. Presented at the Logic Colloquium in Memory of Hugo Ribeiro.

[103]

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-Verlag, 1989.

[104]

J. Carmo and A. Sernadas. Branching versus linear logics yet again. Formal Aspects of Computing, 2(1):24-59, 1990.

[105]

J. Carmo and A. Sernadas. Formal techniques for systems specification and verification. Information Systems, 16(3):245-272, 1991.

[106]

J. Carmo, A. Sernadas, C. Sernadas, F. M. Dionísio, and C. Caleiro. Introdução à Programação em Mathematica (Introduction to Programming in Mathematica). IST Press, 1999.

[107]

J. Carmo, A. Sernadas, C. Sernadas, F. M. Dionísio, and C. Caleiro. Introdução à Programação em Mathematica - Segunda Edição (Introduction to Programming in Mathematica - Second Edition). IST Press, 2004.

[108]

P. Carmo and P. Penedo. Compilador Gnome (Gnome compiler). Research report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 1994. Diploma Thesis. Supervised by A. Sernadas.

[109]

W. Carnielli, J. Rasga, and C. Sernadas. Appendix on Interpolation via translations: proofs as expected. Technical report, SQIG-IT, DM, IST, 1049-001 Lisboa, Portugal, 2008. Appendix to the paper [110] with the full details of the proofs that are just sketched or not proved at all in that paper in order to simplify the presentation since they follow in an expected way.

[110]

W. Carnielli, J. Rasga, and C. Sernadas. Interpolation via translations. Mathematical Logic Quarterly, in print.

[111]

W. A. Carnielli, M. E. Coniglio, D. Gabbay, P. Gouveia, and C. Sernadas. Analysis and Synthesis of Logics - How To Cut And Paste Reasoning Systems, volume 35 of Applied Logic. Springer, 2008.

[112]

W. A. Carnielli, M. E. Coniglio, and J. Marcos. Logics of formal inconsistency. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 14. Kluwer Academic Publishers, 2nd edition, 2007.

[113]

W. A. Carnielli, F. M. Dionísio, and P. Mateus, editors. Proceedings of CombLog'04, Workshop on Combination of Logics: Theory and Applications, 1049-001 Lisboa, Portugal, 2004. Departamento de Matemática, Instituto Superior Técnico.

[114]

W. A. Carnielli and J. Marcos. Limits for paraconsistent calculi. Notre Dame Journal of Formal Logic, 40(3):375-390, 1999.

[115]

W. A. Carnielli and J. Marcos. Ex contradictione non sequitur quodlibet. In R. L. Epstein, editor, Proceedings of the II Annual Conference on Reasoning and Logic, held in Bucharest, RO, July 2000, volume 1, pages 89-109. Advanced Reasoning Forum, 2001.

[116]

W. A. Carnielli and J. Marcos. Tableaux for logics of formal inconsistency. In H. R. Arabnia, editor, Proceedings of the International Conference on Artificial Intelligence (IC-AI'2001), volume II, pages 848-852. CSREA Press, Athens GA, USA, 2001.

[117]

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.

[118]

W. A. Carnielli, J. Marcos, and S. de Amo. Formal inconsistency and evolutionary databases. Logic and Logical Philosophy, 8(2):115-152, 2000.

[119]

W. A. Carnielli and P. Mateus, editors. Selected papers from CombLog'04, volume 13(6) - Special issue of Logic Journal of the IGPL, 2005.

[120]

W. A. Carnielli, J. Rasga, and C. Sernadas. Preservation of interpolation features by fibring. Journal of Logic and Computation, 18(1):123-151, 2008.

[121]

W. A. Carnielli, C. Sernadas, and A. Zanardo. Preservation of interpolation by fibring. In W. A. Carnielli, F. M. Dionísio, and P. Mateus, editors, Proceedings of CombLog'04, Workshop on Combination of Logics: Theory and Applications, pages 151-157, 1049-001 Lisboa, Portugal, 2004. Departamento de Matemática, Instituto Superior Técnico. Extended abstract.

[122]

J. M. B. Carreiras, J. M. C. Pereira, M. L. Campagnolo, and Y. E. Shimabukuro. Assessing the extent of agriculture/pasture and secondary succession forest in the Brazilian Legal Amazon using SPOT VEGETATION data. Remote Sensing of Environment, 101:283-298, 2006.

[123]

A. Carvalho. Category theory in COQ. Technical report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 1998. Diploma thesis. Supervised by A. Sernadas and P. Mateus.

[124]

J. Carvalho. Completude em lógicas modais e temporais (Completeness in modal and temporal logics). Master's thesis, IST, Universidade Técnica de Lisboa, 1996. Supervised by C. Sernadas.

[125]

T. Carvalho. Spatial types for concurrency: A spatial logic to specify and verify distributed systems. Master's thesis, IST, Universidade Técnica de Lisboa, 2007. Supervised by A. Ravara.

[126]

J. Cederquist. A machine assisted formalization of pointfree topology in type theory. Technical report, Chalmers University of Technology and University of Göteborg, Sweden, 1994. Diploma thesis. Supervised by J. Smith.

[127]

J. Cederquist. A Pointfree Approach to Constructive Analysis in Type Theory. PhD thesis, Chalmers University of Technology and University of Göteborg, Sweden, 1997. Supervised by J. Smith.

[128]

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-Verlag, 1998.

[129]

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.

[130]

J. Cederquist, T. Coquand, and S. Negri. The hahn-banach theorem in type theory. In G. Sambin and J. Smith, editors, Proceedings of Twenty-Five Years of Constructive Type Theory, pages 57-72. Oxford University Press, 1998.

[131]

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-Verlag, 2005.

[132]

J. Cederquist, R. J. Corin, M. A. C. Dekker, S. Etalle, and J. I. den Hartog. An audit logic for accountability. In A. Sahai and W. H. Winsborough, editors, 6th Int. Workshop on Policies for Distributed Systems & Networks, pages 34-43, Los Alamitos, California, 2005. IEEE Computer Society.

[133]

J. Cederquist, R. J. Corin, M. A. C. Dekker, S. Etalle, J. I. den Hartog, and G. Lenzini. Audit-based compliance control. International Journal of Information Security, 6(2-3):133-151, 2007.

[134]

J. Cederquist and M. T. Dashti. Fairness constraints for the dolev-yao attacker model. Preprint, SQIG - IT and IST - TU Lisbon, 1049-001 Lisboa, Portugal, 2008. Submitted for publication.

[135]

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.

[136]

J. Cederquist and M. Torabi Dashti. An intruder model for verifying liveness in security protocols. In A. D. Gordon and D. Sands, editors, FMSE '06: Proceedings of the 2006 ACM Workshop on Formal Methods in Security Engineering, pages 23-31, New York, NY, USA, 2006. ACM Press.

[137]

J. Cederquist, M. Torabi Dashti, and S. Mauw. A certified email protocol using key chains. In Proceedings of the 21st International conference on Advanced Information networking and Applications Workshops/Symposia (AINA'07), pages 525-530. IEEE CS press, 2007.

[138]

J. Cederquist and P. Giambiagi. Implementations that preserve confidentiality (extended abstract). Technical report, SQIG - IT, 1049-001 Lisboa, Portugal, 2000. Short presentation at Logic in Computer Science 2000 (LICS'00), Santa Barbara, California.

[139]

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-Verlag, 1995.

[140]

R. Chadha, L. Cruz-Filipe, P. Mateus, and A. Sernadas. Reasoning about probabilistic sequential programs. Theoretical Computer Science, 379(1-2):142-165, 2007.

[141]

R. Chadha, P. Mateus, and A. Sernadas. Reasoning about quantum imperative programs. Electronic Notes in Theoretical Computer Science, 158:19-40, 2006. Invited talk at the Twenty-second Conference on the Mathematical Foundations of Programming Semantics, May 24-27, 2006, Genova.

[142]

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-Verlag, 2006.

[143]

R. Chadha, P. Mateus, A. Sernadas, and C. Sernadas. Extending classical logic for reasoning about quantum systems. In D. Gabbay K. Engesser and D. Lehmann, editors, Handbook of Quantum Logic and Quantum Structures: Quantum Logic, pages 325-372. Elsevier, 2009.

[144]

F. Ciccarello, M. Palma, M. Zarcone, Y. Omar, and V. Rocha Vieira. Entanglement controlled single-electron transmittivity. New Journal of Physics, 8:214, 2006.

[145]

F. Ciccarello, M. Palma, M. Zarcone, Y. Omar, and V. Rocha Vieira. Static disorder in a 1d wire with two quantum scattering centers. Laser Physics, 17(6):889-892, 2007.

[146]

H. Coelho, G. Gaspar, and C. Sernadas. Societies of knowledge based systems. In Proceedings of EuropIA. Hermes Editions, 1988.

[147]

H. Coelho, A. Rodrigues, and A. Sernadas. Towards knowledge-based infolog specifications. Decision Support Systems, 1(2):143-165, 1985.

[148]

P. Collins and D. S. Graça. Effective computability of solutions of differential inclusions -the ten thousand monkeys approach. Preprint, SQIG - IT, 1049-001 Lisboa, Portugal, 2008. Submitted for publication.

[149]

P. Collins and D. S. Graça. Effective computability of solutions of ordinary differential equations - the thousand monkeys approach. Electronic Notes in Theoretical Computer Science, in print. Presented at the Fifth International Conference on Computability and Complexity in Analysis (CCA 2008).

[150]

M. E. Coniglio, A. T. Martins, A. Sernadas, and C. Sernadas. Fibring (para)consistent logics. Research report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2000. Extended abstract. Presented at II World Congress on Paraconsistency - WCP'00.

[151]

M. E. Coniglio, A. Sernadas, and C. Sernadas. Fibring logics with topos semantics. Journal of Logic and Computation, 13(4):595-624, 2003.

[152]

M. E. Coniglio and C. Sernadas. A complete axiomatization of higher-order intuitionistic logic. Research report, CLC, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2002. Presented at X Encontro Nacional de Filosofia, ANPOF.

[153]

S. Conrad, J. Ramos, G. Saake, and C. Sernadas. Evolving logical specification in information systems. In J. Chomicki and G. Saake, editors, Logic for Databases and Information Systems, pages 199-228. Kluwer Academic Publishers, 1998.

[154]

J. F. Costa. Teoria algébrica dos processos animados (Algebraic theory of active processes). Master's thesis, IST, Universidade Técnica de Lisboa, 1990. Supervised by A. Sernadas.

[155]

J. F. Costa. Fundamentos Matemáticos da Concorrência (Mathematical Foundations of Concurrency). PhD thesis, IST, Universidade Técnica de Lisboa, 1992. Supervised by A. Sernadas.

[156]

J. F. Costa and A. Sernadas. Cálculo de actividades e transacções (Calculus of activities and transactions). Estudos de Economia, 13(3):293-317, 1993. Menção Honrosa do Prémio Científico IBM 1992.

[157]

J. F. Costa and A. Sernadas. A categorial framework of process interconnection. The INESC Journal of Research and Development, 4(1):81-93, 1993.

[158]

J. F. Costa and A. Sernadas. Progress assumption in concurrent systems. Formal Aspects of Computing, 7(1):18-36, 1995.

[159]

J. F. Costa, A. Sernadas, and C. Sernadas. OBL-89 users manual. Research report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 1989.

[160]

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-Verlag, 1993.

[161]

J. F. Costa, A. Sernadas, and C. Sernadas. Object inheritance beyond subtyping. Acta Informatica, 31:5-26, 1994.

[162]

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-Verlag, 1992.

[163]

S. Costa, C. Cardeira, J. Pargana, F. M. Dionísio, and P. A. Santos. Systems and signals online questions and grading. In Lucia lo Bello and Thile Sauter, editors, Proceedings of the 10th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2005), pages 41-47. IEEE, 2005. Special Session on E-learning and Remote Laboratories.

[164]

M. J. Coutinho. Estudo categorial do relacionamento entre lógicas (A categorial study of relationships between logics). Master's thesis, IST, Universidade Técnica de Lisboa, 1997. Supervised by C. Sernadas.

[165]

L. Cruz-Filipe. Formalizing real calculus in Coq. In V. Carreõ, C. Munõz, and S. Tahar, editors, Procs. 15th International Conference on Theorem Proving in Higher Order Logics (TPHOLs2002). NASA, 2002.

[166]

L. Cruz-Filipe. Towards automation of real analysis in Coq. Technical report, Dept. of Computer Science, Univ. Nijmegen, P. O. Box 9010, 6500 GL Nijmegen, The Netherlands, 2002. Extended abstract. Poster presented at the Calculemus Autumn School 2002.

[167]

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-Verlag, 2003.

[168]

L. Cruz-Filipe. Constructive Real Analysis: a Type-Theoretical Formalization and Applications. PhD thesis, University of Nijmegen, 2004. Supervised by H. Barendregt.

[169]

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-Verlag, 2004.

[170]

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-Verlag, 2008.

[171]

L. Cruz-Filipe and P. Letouzey. A large-scale experiment in executing extracted programs. Electronic Notes in Theoretical Computer Science, 151(1):75-91, 2006. Presented at CALCULEMUS 2005, July 18-19, 2005, Newcastle upon Tyne, Affiliated Workshop of Formal Methods 2005.

[172]

L. Cruz-Filipe, J. Rasga, A. Sernadas, and C. Sernadas. A complete axiomatization of discrete-measure almost-everywhere quantification. Journal of Logic and Computation, 18(6):885-911, 2008.

[173]

L. Cruz-Filipe, A. Sernadas, and C. Sernadas. Heterogeneous fibring of deductive systems via abstract proof systems. Logic Journal of the IGPL, 16:121-153, 2008.

[174]

L. Cruz-Filipe and C. Sernadas. Sequent calculi based on derivations. Preprint, CLC, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2005.

[175]

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-Verlag, 2003.

[176]

L. Cruz-Filipe and F. Wiedijk. Equational reasoning in algebraic structures: a complete tactic. Preprint, CLC, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2004. Submitted for publication.

[177]

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-Verlag, 2004.

[178]

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-Verlag, Berlin, 2002.

[179]

M. A. C. Decker, J. Cederquist, J. Crampton, and S. Etalle. Extended privilege inheritance in rbac. In R. H. Deng and P. Samarati, editors, Proceedings the 2007 ACM Symposium on Information, Computer and Communications Security, pages 383-385, New York, NY, USA, 2007. ACM Press. Short paper.

[180]

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-Verlag, 1997.

[181]

F. M. Dionísio. Um modelo e submodelos categoriais de processos concorrentes (A categorial model and submodels of concurrent processes). Master's thesis, IST, Universidade Técnica de Lisboa, 1991. Supervised by A. Sernadas.

[182]

F. M. Dionísio. Composition of Hierarchic Default Specifications. PhD thesis, University of Hannover, Germany, 1997. Supervised by U. Lipeck.

[183]

F. M. Dionísio, S. Brass, and M. Ryan. Reasoning about extensions. In U. Lipeck and G. Koschorreck, editors, IS-CORE'93 - Proceedings, pages 178-196. University of Hannover, 1993.

[184]

F. M. Dionísio, S. Brass, M. Ryan, and U. Lipeck. Hypothetical reasoning with defaults. In I. Niemelä and T. Schaub, editors, Proceedings of the Workshop on Computational Aspects of Nonmonotonic Reasoning, pages 9-15. Helsinki University of Technology, 1998.

[185]

F. M. Dionísio, P. Gouveia, and J. Marcos. Defining and using deductive systems with Isabelle. In L. Magnani and R. Dossena, editors, Computing, Philosophy, and Cognition, pages 271-293. King's College Publications, 2005.

[186]

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-Verlag, 1998.

[187]

F. M. Dionísio, U. Lipeck, and S. Brass. Composition and instantiation mechanisms for default theories. Research report, Institut fur Informatik, University of Hannover, Lange Laube 22, Hannover, Germany, 1995. Presented at the 2nd Dutch-German Workshop on Non-monotonic Reasoning Techniques and their Applications.

[188]

F. M. Dionísio, U. Lipeck, and S. Brass. Composition of default specifications. In R. Wieringa and R. Feenstra, editors, IS-CORE'94 - Selected papers, pages 207-221. World Scientific Publishers, 1995.

[189]

F. M. Dionísio and P. Lopes. Quandles at finite temperatures II. Journal of Knot Theory and Its Ramifications, 12(8):1041-1092, 2003.

[190]

H.-D. Ehrich and C. Caleiro. Specifying communication in distributed information systems. Acta Informatica, 36:591-616, 2000.

[191]

H.-D. Ehrich, C. Caleiro, A. Sernadas, and G. Denker. Logics for specifying concurrent information systems. In J. Chomicki and G. Saake, editors, Logic for Databases and Information Systems, pages 167-198. Kluwer Academic Publishers, 1998.

[192]

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-Verlag, 1993.

[193]

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-Verlag, 1993.

[194]

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-Verlag, 1991.

[195]

H.-D. Ehrich, R. Jungclaus, G. Denker, and A. Sernadas. Object-oriented design of information systems: Theoretical foundations. In J. Paredaens and L. Tenenbaum, editors, Advances in Database Systems, Implementations and Applications, pages 201-218. Springer-Verlag, 1994.

[196]

H.-D. Ehrich, G. Saake, and A. Sernadas. Concepts of object orientation. In R. Studer, editor, Informationssysteme und Künstliche Intelligenz, pages 1-17. Springer-Verlag, 1992.

[197]

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-Verlag, 1990.

[198]

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-Verlag, 1995.

[199]

H.-D. Ehrich, A. Sernadas, and C. Sernadas. Abstract object types for databases. In K. Dittrich, editor, Advances in Object-Oriented Database Systems, pages 144-149. Springer-Verlag, 1988.

[200]

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-Verlag, 1989.

[201]

H.-D. Ehrich, A. Sernadas, and C. Sernadas. From data types to object types. Journal of Information Processing and Cybernetics EIK, 26(1):33-48, 1990.

[202]

J. Espírito-Santo. Chu e Galois: Polaridade, conexão e adjunção (Chu and Galois: Polarity, connection and adjunction). Master's thesis, IST, Universidade Técnica de Lisboa, 1997. Supervised by C. Sernadas.

[203]

J. Fiadeiro. Cálculo de Objectos e Eventos (A Calculus for Reasoning with Objects and Events). PhD thesis, IST, Universidade Técnica de Lisboa, 1989. Supervised by A. Sernadas.

[204]

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-Verlag, 1993.

[205]

J. Fiadeiro and A. Sernadas. The infolog linear tense logic of events and transactions. Information Systems, 11(1):61-85, 1986.

[206]

J. Fiadeiro and A. Sernadas. Behavioural aspects of intelligent knowledge-based information systems. In C. Rolland, F. Bodart, and M. Leonard, editors, Temporal Aspects in Information Systems, pages 77-92. North-Holland, 1988.

[207]

J. Fiadeiro and A. Sernadas. Specification and verification of database dynamics. Acta Informatica, 25:625-661, 1988.

[208]

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-Verlag, 1988.

[209]

J. Fiadeiro and A. Sernadas. Logics of modal terms for systems specification. Journal of Logic and Computation, 1(2):187-227, 1990.

[210]

J. Fiadeiro and A. Sernadas. Structuring theories for knowledge representation. In J. Falcão e Cunha, editor, Terceira Escola Avançada em Inteligência Artificial, pages 21-25. APPIA, 1992.

[211]

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-Verlag, 1988.

[212]

J. Fiadeiro, C. Sernadas, T. Maibaum, and G. Saake. Proof-theoretic semantics of object-oriented specification constructs. In R. Meersman W. Kent and S. Khosla, editors, Object Oriented Databases: Analysis, Design and Construction, pages 243-284. North-Holland, 1991.

[213]

J. Fiadeiro, C. Sernadas, T. Maibaum, and A. Sernadas. Describing and structuring objects for conceptual schema development. In P. Loucopoulos and R. Zicari, editors, Conceptual Modelling, Databases and CASE: An Integrated View of Information Systems Development, pages 117-138. John Wiley, 1992.

[214]

A. Francisco. Algoritmos para a predição da estrutura terciária de proteínas (Algorithms for the prediction of the tertiary structure of proteins). Master's thesis, IST, Universidade Técnica de Lisboa, 2004. Supervised by A. Oliveira and A. Sernadas.

[215]

M. Gamboni. Topic: Models and Proof Methods for Information Protection. PhD thesis, IST, Universidade Técnica de Lisboa, in preparation. Expected submission: 2009. Supervised by A. Ravara.

[216]

J. Gomes. Lógica temporal de objectos com tempo explícito (Temporal object logic with explicit time). Master's thesis, IST, Universidade Técnica de Lisboa, 1996. Supervised by C. Sernadas.

[217]

R. Gonçalves. Algebraization of logics and beyond. Technical report, CLC, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2004. Diploma thesis. Supervised by C. Caleiro.

[218]

R. Gonçalves. Behavioral algebraization of logics. PhD thesis, IST, Universidade Técnica de Lisboa, 2008. Supervised by C. Caleiro.

[219]

P. Gouveia. Tableaux para raciocínio local sobre objectos (Tableaux for local reasoning about objects). Master's thesis, IST, Universidade Técnica de Lisboa, 1993. Supervised by C. Sernadas.

[220]

P. Gouveia. Raciocínio Abdutivo sobre Especificações Temporais de Objectos (Abductive Reasoning over Temporal Specifications of Objects). PhD thesis, IST, Universidade Técnica de Lisboa, 1998. Supervised by C. Sernadas.

[221]

P. Gouveia, F. M. Dionísio, and J. Marcos. Teaching and experimenting with deductive systems using a generic proof assistant. In XIII Simposio Latinoamericano de Lógica Matemática, volume 1 of Proceedings of the XIII SLALM, pages 49-50, Oaxaca, México, 2006.

[222]

P. Gouveia and J. Ramos. Multi-agent systems specification and certification: A situation and state calculus approach. Annals of Mathematics and Artificial Intelligence, 41(2-4):301-338, 2004.

[223]

P. Gouveia and C. Sernadas. Reasoning aspects in information systems and databases. In A. Olivé, editor, The Deductive Approach to Information Systems and Databases 93, pages 201-224. Universitat Politècnica de Catalunya, 1993.

[224]

P. Gouveia and C. Sernadas. Abduction in temporal object specification using tableaux. In P. Baumgartner, R. Hahnle, and J. Possega, editors, 4th Workshop on Theorem Proving with Analytic Tableaux and Related Methods - Poster Session and Short Papers, pages 43-48. University of Koblenz, 1995.

[225]

P. Gouveia and C. Sernadas. Introducing explanations in temporal object specification. In R. Wieringa and R. Feenstra, editors, IS-CORE'94 - Selected Papers, pages 53-68. World Scientific Publishers, 1995.

[226]

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.

[227]

P. Gouveia, C. Sernadas, J. Gomes, and J. Apolinário. Tableaux for reasoning about objects. In D. Basin, R. Hahnle, B. Fronhofer, J. Possegge, and C. Schwind, editors, Theorem Proving with Analytic Tableaux and Related Methods, pages 113-125. Max-Planck-Institut für Informatik, 1993.

[228]

D. S. Graça. The general purpose analog computer and recursive functions over the reals. Master's thesis, IST, Universidade Técnica de Lisboa, 2002. Supervised by J. F. Costa.

[229]

D. S. Graça. Computability via analog circuits. In V. Brattka, M. Schröder, K. Weihrauch, and N. Zhong, editors, Procs. International Conference on Computability and Complexity in Analysis, pages 229-240. FernUniversität in Hagen, 2003.

[230]

D. S. Graça. Some recent developments on Shannon's General Purpose Analog Computer. Mathematical Logic Quarterly, 50(4-5):473-485, 2004.

[231]

D. S. Graça. Computability with Polynomial Differential Equations. PhD thesis, IST, Universidade Técnica de Lisboa, 2007. Supervised by M. Campagnolo and J. Buescu.

[232]

D. S. Graça, J. Buescu, and M. L. Campagnolo. Boundedness of the domain of definition is undecidable for polynomial odes. Electronic Notes in Theoretical Computer Science, 202:49-57, 2008. Proceedings of the 4th International Conference of Computability and Complexity in Analysis (CCA 2007).

[233]

D. S. Graça, J. Buescu, and M. L. Campagnolo. Computational bounds on polynomial differential equations. Applied Mathematics and Computation, in print.

[234]

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-Verlag, 2005.

[235]

D. S. Graça, M. L. Campagnolo, and J. Buescu. Computability with polynomial differential equations. Advances in Applied Mathematics, 40(3):330–-349, 2008.

[236]

D. S. Graça and J. F. Costa. Analog computers and recursive functions over the reals. Journal of Complexity, 19(5):644-664, 2003.

[237]

D. S. Graça, N. Zhong, and J. Buescu. The ordinary differential equation defined by a computable function whose maximal interval of existence is non-computable. In G. Hanrot and P. Zimmermann, editors, Proceedings of the 7th Conference on Real Numbers and Computers (RNC 7), pages 33-40. LORIA/INRIA, 2006.

[238]

D. S. Graça, N. Zhong, and J. Buescu. Computability, noncomputability and undecidability of maximal intervals of IVPs. Transactions of the American Mathematical Society, in print.

[239]

D. S. Graça. Computability and dynamical systems: A perspective. In Proceedings of the 26th Weak Arithmetics Days, pages 95-107. Universidad de Sevilla, 2008.

[240]

S. Guerra. Defaults in the Specification of Reactive Systems. PhD thesis, IST, Universidade Técnica de Lisboa, 1999. Supervised by M. Ryan and A. Sernadas.

[241]

C. Hermida. Fibrations, logical predicates and related topics. PhD thesis, University of Edinburgh, 1993. Tech. Report ECS-LFCS-93-277. Also available as Aarhus Univ. DAIMI Tech. Report PB-462.

[242]

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 Verlag, 1994.

[243]

C. Hermida. Some properties of fib as a fibred 2-category. Journal of Pure and Applied Algebra, 134(1):83-109, 1999. Presented at ECCT'94, Tours, France.

[244]

C. Hermida. Representable multicategories. Advances in Mathematics, 151:164-225, 2000.

[245]

C. Hermida. From coherent structures to universal properties. Journal of Pure and Applied Algebra, 165(1):7-61, 2001.

[246]

C. Hermida. A categorical outlook on relational modalities and simulations. Preprint, CLC, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2002. Presented at IMLA'02, Copenhagen.

[247]

C. Hermida. Descent on 2-fibrations and strongly 2-regular 2-categories. Applied Categorical Structures, 12(5-6):427-459, 2004.

[248]

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.

[249]

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-Verlag, May 1995.

[250]

C. Hermida and B. Jacobs. Fibrations with indeterminates: Contextual and functional completeness for polymorphic lambda calculi. Mathematical Structures in Computer Science, 5:501-531, 1995.

[251]

C. Hermida and B. Jacobs. Structural induction and coinduction in a fibrational setting. Information and Computation, 145(2):107-152, 1998.

[252]

C. Hermida, M. Makkai, and P. Power. Higher-dimensional multigraphs. In Logic in Computer Science (LICS) '98. IEEE, 1998.

[253]

C. Hermida, M. Makkai, and P. Power. On weak higher-dimensional categories I, part I. Journal of Pure and Applied Algebra, 154(1-3):221-246, 2000.

[254]

C. Hermida, M. Makkai, and P. Power. On weak higher-dimensional categories I, part II. Journal of Pure and Applied Algebra, 157(2-3):247-277, 2001.

[255]

C. Hermida, M. Makkai, and P. Power. On weak higher-dimensional categories I, part III. Journal of Pure and Applied Algebra, 166(1-2):83-104, 2002.

[256]

C. Hermida and P. Mateus. Paracategories I: Internal paracategories and saturated partial algebras. Theoretical Computer Science, 309:125-156, 2003.

[257]

C. Hermida and P. Mateus. Paracategories II: Adjunctions, fibrations and examples from probabilistic automata theory. Theoretical Computer Science, 311:71-103, 2004.

[258]

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-Verlag, August 1995.

[259]

C. Hermida and R. D. Tennent. Monoidal indeterminates and categories of possible worlds. Preprint, SQIG - IT and IST, 1049-001 Lisboa, Portugal, 2007. Submitted for publication.

[260]

M. A. Hoff, K. G. Roggia, and P. B. Menezes. Composition of transformations: A framework for systems with dynamic topology. International Journal Of Computing Anticipatory Systems, 14:259-270, 2004. Preliminary version presented at CASYS'2003.

[261]

H. Hüttel, J. Kleist, U. Nestmann, and A. Ravara, editors. Proceedings of the Workshop on Semantics of Objects as Processes SOAP'99, volume NS-99-2 of BRICS Notes Series. Danish Institute of Basic Research in Computer Science, 1999. Lisbon, Portugal, June 15, 1999.

[262]

A. T. Costa Jr, S. Bose, and Y. Omar. Entanglement of two impurities through electron scattering. Physical Review Letters, 96(23):230501, 2006.

[263]

R. Jungclaus, G. Saake, T. Hartmann, and C. Sernadas. Troll: A language for object-oriented specification of information systems. ACM Transactions on Information Systems, 14(2):175-211, 1996.

[264]

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-Verlag, 1991.

[265]

R. Jungclaus, G. Saake, and C. Sernadas. Using active objects for query processing. In R. Meersman W. Kent and S. Khosla, editors, Object Oriented Databases: Analysis, Design and Construction, pages 285-303. North-Holland, 1991.

[266]

I. Lanese, V. Vasconcelos, F. Martins, and A. Ravara. Disciplining orchestration and conversation in service-oriented computing. In 5th IEEE International Conference on Software Engineering and Formal Methods, pages 305-314. IEEE, 2007.

[267]

R. Li and A. Sernadas. Reasoning about objects using tableau method. Journal of Logic and Computation, 1(5):575-611, 1991.

[268]

G. Lohman, A. Sernadas, and R. Camps, editors. Proceedings of the Seventeenth International Conference on Very Large Data Bases. VLDB, 1991.

[269]

C. Lourenço. Control of Chaos and Information Processing in Neuronal Networks. PhD thesis, Université Libre de Bruxelles, 1996. Supervised by A. Babloyantz.

[270]

C. Lourenço. Attention-locked computation with chaotic neural nets. International Journal of Bifurcation and Chaos, 14(2):737-760, 2004.

[271]

C. Lourenço. Dynamical reservoir properties as network effects. In M. Verleysen, editor, Proceedings of the 14th European Symposium on Artificial Neural Networks (ESANN'06), pages 503-508. d-side, 2006.

[272]

C. Lourenço. A very small chaotic neural net. In Proceedings of the 2006 International Joint Conference on Neural Networks (IJCNN'06) at the 2006 IEEE World Congress on Computational Intelligence, pages 8341-8344. IEEE, 2006.

[273]

C. Lourenço. Dynamical computation reservoir emerging within a biological network. Neurocomputing, 70:1177-1185, 2007.

[274]

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.

[275]

C. Lourenço. Structured reservoir computing with spatiotemporal chaotic attractors. In M. Verleysen, editor, Proceedings the 15th European Symposium on Artificial Neural Networks (ESANN 2007), pages 501-506, 2007.

[276]

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-Verlag, 2008.

[277]

C. Lourenço and A. Babloyantz. Control of chaos in networks with delay: A model for synchronization of cortical tissue. Neural Computation, 6:1141-1154, 1994.

[278]

C. Lourenço and A. Babloyantz. Control of spatiotemporal chaos in neuronal networks. International Journal of Neural Systems, 7:507-517, 1996.

[279]

C. Lourenço, A. Babloyantz, and M. Hougardy. Pattern segmentation in a binary/analog world: Unsupervised learning versus memory storing. Neural Networks, 13:71-89, 2000.

[280]

C. Lourenço, M. Hougardy, and A. Babloyantz. Control of low-dimensional spatiotemporal chaos in Fourier space. Physical Review E, 52:1528-1532, 1995.

[281]

H. Lourenço and A. Sernadas. Combining hybrid systems. Research report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 1999.

[282]

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-Verlag, 2000.

[283]

H. Lourenço, A. Sernadas, and C. Sernadas. Aggregation and interconnection of hybrid automata: Categorial characterization. Research report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 1998. Presented at FIREworks Meeting, Magdeburg, May 15-16.

[284]

S. Marcelino. Applications of supported quantales to modal logic. Technical report, CLC, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2006. Diploma thesis. Supervised by P. Resende.

[285]

J. Marcos. Semânticas de Traduções possíveis. Master's thesis, IFCH, Universidade Estadual de Campinas, 1999. Supervised by W. A. Carnielli.

[286]

J. Marcos. Possible-translations semantics. In W. A. Carnielli, F. M. Dionísio, and P. Mateus, editors, Proceedings of CombLog'04, Workshop on Combination of Logics: Theory and Applications, pages 119-128, 1049-001 Lisboa, Portugal, 2004. Departamento de Matemática, Instituto Superior Técnico. Extended version of extended abstract.

[287]

J. Marcos. Logics of essence and accident. Bulletin of the Section of Logic, 34(1):43-56, 2005.

[288]

J. Marcos. Logics of Formal Inconsistency. PhD thesis, IFCH, Universidade Estadual de Campinas and IST, Universidade Técnica de Lisboa, 2005. Supervised by W. A. Carnielli and C. Caleiro.

[289]

J. Marcos. Modality and paraconsistency. In M. Bilkova and L. Behounek, editors, The Logica Yearbook 2004, pages 213-222. Filosofia, 2005.

[290]

J. Marcos. Nearly every normal modal logic is paranormal. Logique et Analyse, 48:279-300, 2005.

[291]

J. Marcos. On a problem of da Costa. In G. Sica, editor, Essays on the Foundations of Mathematics and Logic, volume 2, pages 39-55. Polimetrica, 2005.

[292]

J. Marcos. On negation: Pure local rules. Journal of Applied Logic, 3(1):185-219, 2005.

[293]

J. Marcos. Generalizing truth-functionality (abstract). Bulletin of Symbolic Logic, 12(3):511-511, 2006.

[294]

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.

[295]

J. Marcos. Possible-translations semantics for some weak classically-based paraconsistent logics. Journal of Applied Non-Classical Logics, 18(1):7-28, 2008.

[296]

J. Marcos, D. Batens, and W. A. Carnielli, editors. A Paraconsistent Decagon, volume 3(1) - Special issue of Journal of Applied Logic, 2005.

[297]

J. Martinho. The pi-calculus with polyadic synchronization. Master's thesis, Department of Computer Science, University of Aalborg, Denmark, 2004. Supervised by L. Aceto and A. Ravara.

[298]

J. Martinho and A. Ravara. Encoding cryptographic primitives in a calculus with polyadic synchronization. In Proceedings the 2008 International Conference on Theoretical and Mathematical Foundations of Computer Science (TMFCS-08), pages 102-109. ISRST, 2008.

[299]

F. Martins and A. Ravara. Typing migration control in lsdpi. In Andrei Sabelfield, editor, Proceedings of FCS'04, Workshop on Foundations Computer Security, volume 31, pages 1-12. Turku Centre for Computer Science, 2004.

[300]

S. Martins. Estruturas lógicas proposicionais monótonas e não monótonas (Monotonic and non monotonic propositional logic structures). Master's thesis, IST, Universidade Técnica de Lisboa, 1999. Supervised by F. M. Dionísio.

[301]

P. Mateus. Categorial results in compositional model checking. Technical report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 1997. Diploma thesis. Supervised by A. Sernadas.

[302]

P. Mateus. Interconnection of Probabilistic Systems. PhD thesis, IST, Universidade Técnica de Lisboa, 2000. Supervised by A. Sernadas and C. Sernadas.

[303]

P. Mateus. Attacking zero-knowledge proof systems. Research report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2005. In Portuguese. Awarded the Portuguese IBM Scientific Prize 2005.

[304]

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-Verlag, 2003.

[305]

P. Mateus, M. Cabral Morais, C. Nunes, A. Pacheco, A. Sernadas, and C. Sernadas. Categorical foundations for randomly timed automata. Theoretical Computer Science, 308:393-427, 2003.

[306]

P. Mateus, F. Moura, and J. Rasga. Transferring proofs of zero-knowledge systems with quantum correlations. In P. Dini et al, editor, Proceedings of the First Workshop on Quantum Security: QSec'07, page 0009. IEEE Press, 2007. Joint e-proceedings with Quantum, Nano, and Micro Technologies: ICQNM '07. 6 pages.

[307]

P. Mateus and Y. Omar. Quantum pattern matching. Preprint, CLC, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2005. ArXiv quant-ph/0508237. Full version of [308].

[308]

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 [307].

[309]

P. Mateus, A. Pacheco, and J. Pinto. Observations and the probabilistic situation calculus. In D. Fensel, F. Giunchiglia, D. McGuinness, and M.-A. Williams, editors, Procs. Eighth International Conference on Principles of Knowledge Representation and Reasoning (KR2002), pages 327-338. Morgan Kaufmann, 2002.

[310]

P. Mateus, A. Pacheco, J. Pinto, A. Sernadas, and C. Sernadas. Probabilistic situation calculus. Annals of Mathematics and Artificial Intelligence, 32(1/4):393-431, 2001.

[311]

P. Mateus, J. Ramos, A. Sernadas, and C. Sernadas. Temporal logics for reasoning about quantum systems. In I. Mackie and S. Gay, editors, Semantics of Quantum Computation. Cambridge University Press, in print.

[312]

P. Mateus, J. Rasga, and C. Sernadas. Modal sequent calculi labelled with truth values: Cut elimination. Logic Journal of the IGPL, 13(2):173-199, 2005.

[313]

P. Mateus, T. Reis, and L. Viganò. Protocol insecurity with cost-sensitive guessing intruder is NP-complete. Preprint, SQIG - IT and IST - TU Lisbon, 1049-001 Lisboa, Portugal, 2007. Submitted for publication.

[314]

P. Mateus and A. Sernadas. Exogenous quantum logic. In W. A. Carnielli, F. M. Dionísio, and P. Mateus, editors, Proceedings of CombLog'04, Workshop on Combination of Logics: Theory and Applications, pages 141-149, 1049-001 Lisboa, Portugal, 2004. Departamento de Matemática, Instituto Superior Técnico. Extended abstract.

[315]

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-Verlag, 2004.

[316]

P. Mateus and A. Sernadas. Complete exogenous quantum propositional logic. Technical report, CLC, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2005. Extended abstract. Short presentation at LICS 2005, Chicago, USA, June 26-29.

[317]

P. Mateus and A. Sernadas. Weakly complete axiomatization of exogenous quantum propositional logic. Information and Computation, 204(5):771-794, 2006. ArXiv math.LO/0503453.

[318]

P. Mateus, A. Sernadas, and C. Sernadas. Precategories for combining probabilistic automata. Electronic Notes in Theoretical Computer Science, 29, 1999. Early version presented at FIREworks Meeting, Magdeburg, May 15-16, 1998. Presented at CTCS'99, Edinburgh, September 10-12, 1999.

[319]

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-Verlag, 2000.

[320]

P. Mateus, A. Sernadas, and C. Sernadas. Exogenous semantics approach to enriching logics. In G. Sica, editor, Essays on the Foundations of Mathematics and Logic, volume 1, pages 165-194. Polimetrica, 2005.

[321]

P. Mateus, A. Sernadas, C. Sernadas, and L. Viganò. Modal sequent calculi labelled with truth values: Completeness, duality and analyticity. Logic Journal of the IGPL, 12(3):227-274, 2004.

[322]

P. Mateus and S. Vaudenay. The trusted agent model - defeating privacy enhancement using seals. Preprint, SQIG - IT and IST - TU Lisbon, 1049-001 Lisboa, Portugal, 2007. Submitted for publication - only abstract is available for download.

[323]

R. Meersman and A. Sernadas, editors. Data and Knowledge. North-Holland, 1988.

[324]

P. Menezes, A. Costa, L. Machado, and J. Ramos. Nautilus: A concurrent anticipatory programming language. In D. Dubois, editor, Computing Anticipatoty Systems: CASYS'01 - Fifth International Conference, volume 627 of AIP Conference Proceedings, pages 553-564. American Institute of Physics, 2002.

[325]

P. B. Menezes. Reificação de Objectos Concorrentes (Reification of Concurrent Objects). PhD thesis, IST, Universidade Técnica de Lisboa, 1997. Supervised by A. Sernadas.

[326]

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-Verlag, 1996.

[327]

P. B. Menezes, K. G. Roggia, and J. H. A. P. Machado. Hierarquia de modelos para concorrência. In WMF'2002: V Workshop de Métodos Formais, volume 1 of Proceedings of the 5th Workshop on Formal Methods, pages 3-3, Porto Alegre, 2002. Instituto de Informática da UFRGS.

[328]

P. B. Menezes, A. Sernadas, and J. F. Costa. Refinement in a concurrent object-base language. In R. Bigonha, editor, Proceedings of the First Brazilian Symposium on Programming Languages, pages 237-250. Sociedade Brazileira de Computação, 1996.

[329]

P. B. Menezes, A. Sernadas, and J. F. Costa. Nonsequential automata semantics for a concurrent object-based language. Electronic Notes in Theoretical Computer Science, 14, 1998.

[330]

B. Montalto. Modelling an attacker with cryptanalytical capbilities. Master's thesis, IST, Universidade Técnica de Lisboa, 2008. Supervised by C. Caleiro.

[331]

F. Moura. Four dimensional N=1 supersymmetrization of R⁴ in superspace. Journal of High Energy Physics, 09:26-55, 2001.

[332]

F. Moura. Four dimensional R⁴ superinvariants through gauge completion. Journal of High Energy Physics, 08:38-55, 2002.

[333]

F. Moura. Four dimensional 'old minimal' N=2 supersymmetrization of R⁴. Journal of High Energy Physics, 07:57-80, 2003.

[334]

F. Moura. Four dimensional supersymmetrization of R⁴. In P. Nath, editor, Proceedings of the International Conference on 20 Years of SUGRA and Search for SUSY and Unification (SUGRA 20), pages 279-283, 2003.

[335]

F. Moura. String corrections to supergravity theories. PhD thesis, State University of New York at Stony Brook, 2003. Supervised by M. Rocek.

[336]

F. Moura. Superspace supergravity and supersymmetrization of R\sp 4. In Proceedings of the XII Fall Workshop on Geometry and Physics, volume 7 of Publicaciones de la Real Sociedad Matemática Española, pages 173-180. Real Sociedad Matemática Española, Madrid, 2004.

[337]

F. Moura. Perturbation theory and stability analysis for string- corrected black holes in arbitrary dimensions. In L. Mornas and J. D. Alonso, editors, Proceedings of the 28th Spanish Relativity Meeting (ERE05): A Century of Relativity Physics, volume 841 of AIP conference proceedings, pages 542-545. American Institute of Physics, 2006.

[338]

F. Moura. Perturbative stability and absorption cross section in string corrected black holes. Preprint, SQIG - IT and IST, 1049-001 Lisboa, Portugal, 2007. Submitted for publication.

[339]

F. Moura. Type II and heterotic one loop string effective actions in four dimensions. Journal of High Energy Physics, 06:052, 2007.

[340]

F. Moura. One loop superstring effective actions and n=8 supergravity. Physical Reviews D, 77:125011, 2008.

[341]

F. Moura and R. Schiappa. Higher-derivative corrected black holes: Perturbative stability and absorption cross-section in heterotic string theory. Classical and Quantum Gravity, 24(2):361-386, 2007.

[342]

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-Verlag, 1999. An introduction to, and summary of, the 2nd International SOAP Workshop.

[343]

U. Nestmann and A. Ravara. What's tyco, after all? Research report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2000. Short abstract. Presented at Express'00, satellite event of CONCUR'00.

[344]

A. L. Nunes. Temporalização de lógicas (Temporalisation of logics). Master's thesis, IST, Universidade Técnica de Lisboa, 1998. Supervised by C. Sernadas.

[345]

K. Ojakian. Combinatorics in Bounded Arithmetic. PhD thesis, Carnegie Mellon University, 2004. Supervised by J. Avigad.

[346]

K. Ojakian. Upper and lower ramsey bounds in bounded arithmetic. Annals of Pure and Applied Logic, 135:135-150, 2005.

[347]

Y. Omar. Indistinguishable particles in quantum mechanics: An introduction. Contemporary Physics, 46:437-448, 2005.

[348]

Y. Omar. Particle statistics in quantum information processing. International Journal of Quantum Information, 3(1):201-205, 2005.

[349]

Y. Omar, N. Paunkovic, S. Bose, and V. Vedral. Spin-space entanglement transfer and quantum statistics. Physical Review A, 65:062305, 2002. ArXiv quant-ph/0105120.

[350]

Y. Omar, N. Paunkovic, S. Bose, and V. Vedral. Quantum entanglement and particle statistics. In J. H. Shapiro and O. Hirota, editors, Proceedings of the Sixth International Conference on Quantum Communication, Measurement and Computing (QCMC), page 33. Rinton, Princeton, 2003.

[351]

Y. Omar, N. Paunkovic, L. Sheridan, and S. Bose. Quantum walk on a line with two entangled particles. Physical Review A, 74:042304, 2006. ArXiv 0411065 [quant-ph].

[352]

Y. Omar, N. Paunkovic, and V. R. Vieira. Macroscopic thermal entanglement. In J. M. P. Carmelo, J. M. B. Lopes dos Santos, V. R. Vieira, and P. D. Sacramento, editors, Strongly Correlated Systems, Coherence and Entanglement, pages 567-595. World Scientific, 2007.

[353]

S. Pacheco. Situation Calculus in COQ. Technical report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 1998. Diploma thesis. Supervised by A. Sernadas and J. Ramos.

[354]

N. Paiva. Temporal logic in COQ. Technical report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 1998. Diploma thesis. Supervised by A. Sernadas and C. Caleiro.

[355]

I. Patiño. A proof theory of interpolation. Master's thesis, Universidade Nova de Lisboa / Technische Universität Wien, 2007. Supervised by J. Rasga.

[356]

N. Paunkovic. The Role of Indistinguishability of Identical Particles in Quantum Information Processing. PhD thesis, Centre for Quantum Computation, Clarendon Laboratory, University of Oxford, 2004. Supervised by V. Vedral and A. Ekert.

[357]

N. Paunkovic, Y. Omar, S. Bose, and V. Vedral. Entanglement concentration using quantum statistics. Physical Review Letters, 88:187903, 2002. ArXiv quant-ph/0112004.

[358]

N. Paunkovic, P. D. Sacramento, P. Nogueira, V. R. Vieira, and V. K. Dugaev. Fidelity between partial states as signature of quantum phase transitions. Physical Review A, 77:052302, 2008. ArXiv 0708.3494 [quant-ph].

[359]

N. Paunkovic and V. R. Vieira. Macroscopic distinguishability between quantum states defining different phases of matter: Fidelity and the Uhlmann geometric phase. Physical Review E, 77:011129, 2008. ArXiv 0707.4667 [quant-ph].

[360]

J. Pinto, A. Sernadas, C. Sernadas, and P. Mateus. Non-determinism and uncertainty in the Situation Calculus. In A. Kumar and I. Russell, editors, Proceedings of the FLAIRS'99 - the 12th International Florida AI Research Symposium, pages 454-460. AAAI Press, 1999. Short version of [361].

[361]

J. Pinto, A. Sernadas, C. Sernadas, and P. Mateus. Non-determinism and uncertainty in the Situation Calculus. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 8(2):127-149, 2000. Full version of [360].

[362]

J. Ramos. Lógica de certificação Gnome (Gnome certification logic). Master's thesis, IST, Universidade Técnica de Lisboa, 1994. Supervised by A. Sernadas.

[363]

J. Ramos. The situation and state calculus. In A. Drewery, G.-J. Kruijff, and R. Zuber, editors, Proceedings of the Second ESSLII Student Session, 1997.

[364]

J. Ramos. The Situation and State Calculus: Specification and Verification. PhD thesis, IST, Universidade Técnica de Lisboa, 2000. Supervised by A. Sernadas.

[365]

J. Ramos and A. Sernadas. A brief introduction to Gnome. Research report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 1995.

[366]

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-Verlag, 1999.

[367]

J. Rasga. Fibring Labelled First-order Based Logics. PhD thesis, IST, Universidade Técnica de Lisboa, 2003. Supervised by C. Sernadas.

[368]

J. Rasga. Complexity analysis of cut elimination in first order based logics. Preprint, CLC, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2005. Extended abstract. Presented at PCC - Proof, Computation, Complexity, July 16-17, Lisboa, Affiliated Workshop of ICALP'05.

[369]

J. Rasga. Cut elimination in propositional based logics. In P. Bruscoli, F. Lamarche, and C. Stewart, editors, Proceedings of Structures and Deduction - the Quest for the Essence of Proofs (satellite workshop of ICALP'05), pages 205-214. Technische Universität Dresden, 2005.

[370]

J. Rasga. Sufficient conditions for cut elimination with complexity analysis. Annals of Pure and Applied Logic, 149(1-3):81-99, 2007.

[371]

J. Rasga, A. Sernadas, C. Sernadas, and L. Viganò. Fibring labelled deduction systems. Journal of Logic and Computation, 12(3):443-473, 2002.

[372]

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-Verlag, 2002.

[373]

A. Ravara. Semântica da linguagem Gnome em TyCO (Semantics of Gnome over TyCO). Master's thesis, IST, Universidade Técnica de Lisboa, 1996. Supervised by A. Sernadas.

[374]

A. Ravara. Typing Non-Uniform Concurrent Objects. PhD thesis, IST, Universidade Técnica de Lisboa, 2000. Supervised by V. Vasconcelos and A. Sernadas.

[375]

A. Ravara, A. Almeida Matos, V. T. Vasconcelos, and L. Lopes. A lexically scoped distributed pi-calculus. Research report, Department of Computer Science, University of Lisbon, Campo Grande, Edifício C5, 1749-016 Lisboa, Portugal, 2002.

[376]

A. Ravara, A. Almeida Matos, V. T. Vasconcelos, and L. Lopes. Lexically scoped distribution: what you see is what you get. Electronic Notes in Theoretical Computer Science, 85(1), 2003. Presented at FGC'03.

[377]

A. Ravara and L. Lopes. Programming and implementation issues in non-unifom tyco. Technical report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 1999. Presented at OOSDS'99 (Satellite Event of ICFP'99), Paris.

[378]

A. Ravara, P. Resende, and V. Vasconcelos. Towards an algebra of dynamic object types. In ICALP'98 workshop Semantics of Objects as Processes. BRICS Note Series, 1998.

[379]

A. Ravara, P. Resende, and V. Vasconcelos. An algebra of behavioural types. Preprint, CLC, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2002. Submitted for publication.

[380]

A. Ravara and V. Vasconcelos. Operational semantics and type system for Gnome on TYped Concurrent Objects. In Max Mühlhäuser, editor, Special Issues in Object-Oriented Programming. Dpunkt Verlag, 1996. Workshop Reader of the 10th European Conference on Object-Oriented Programming (ECOOP'96). Available as Research Report DM-IST 17/96.

[381]

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-Verlag, 1997. Full version available as DM-IST Research Report 06/97.

[382]

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-Verlag, 2000. Short version of [383].

[383]

A. Ravara and V. Vasconcelos. Typing non-uniform concurrent objects. Research report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2000. Extended version of [382].

[384]

G. Reichwein, A. Sernadas, and J. Fiadeiro. Ensuring and maintaining quality through formal object-oriented design. In A. Bertolino and M. Fusani, editors, Software Quality Principles and Techniques, pages 55-67. ERCIM, 1992.

[385]

T. Reis. Quantitative analysis of security protocols. Technical report, CLC, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2005. Diploma thesis. Supervised by P. Mateus.

[386]

P. Resende. Tableaux para lógica dinâmica proposicional (Tableaux for propositional dynamic logic). Master's thesis, IST, Universidade Técnica de Lisboa, 1991. Supervised by A. Sernadas.

[387]

P. Resende. Tropological Systems and Observational Logic in Concurrency and Specification. PhD thesis, IST, Universidade Técnica de Lisboa, 1998. Supervised by A. Sernadas.

[388]

M. Rocheta, F. M. Dionísio, L. Fonseca, and A. M. Pires. Paternity analysis in excel. Computer Methods and Programs in Biomedicine, 88(3):234-238, 2007.

[389]

K. G. Roggia. Categoria de grafos parciais com homomorfismos totais: Teoria e aplicações. Master's thesis, Programa de Pós-Graduação em Computação - UFRGS, Porto Alegre, Brasil, 2005. Supervised by Paulo Blauth Menezes.

[390]

K. G. Roggia. Topic: Deduction Systems for Quantum Logic. PhD thesis, IST, Universidade Técnica de Lisboa, in preparation. Expected submission: 2009. Supervised by C. Sernadas.

[391]

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-Verlag, 2005.

[392]

K. G. Roggia, P. B. Menezes, and M. A. Hoff. Bicompleteness in the category of partial graphs with total homomorphisms. Electronic Journal on Mathematics of Computation, 2(1), 2005.

[393]

L. S. Russo. Algebra in a topos. Technical report, CLC, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2003. Diploma thesis. Supervised by P. Resende.

[394]

M. Ryan, A. Sernadas, and C. Sernadas. Adjunctions between default frameworks. In R. Wieringa and R. Feenstra, editors, IS-CORE'94 - Selected papers, pages 155-172. World Scientific Publishers, 1995.

[395]

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-Verlag, 1991.

[396]

G. Saake and A. Sernadas, editors. Esprit BRA IS-CORE 91 Workshop - Selected Papers. TUBS, 1991.

[397]

G. Saake, A. Sernadas, and C. Sernadas. Evolving object specifications. In R. Wieringa and R. Feenstra, editors, IS-CORE'94 - Selected papers, pages 84-99. World Scientific Publishers, 1995.

[398]

S. Sakadzic, N. Paunkovic, Dj. Sarac, and Z. Petrovic. Electron transport in ammonia. In B. Vujicic, S. Djurovic, and J. Puric, editors, Contributed Papers and Abstracts of Invited Lectures and Progress Reports, 18th SPIG (Summer School and International Symposium on the Physics of Ionized Gases), page 132, 1996.

[399]

A. M. Santos, P. A. Santos, F. M. Dionísio, and P. Duarte. Online assessment in undergraduate mathematics. In C. Tzanakis, editor, Procs. 2nd International Conference on the Teaching of Mathematics (ICTM2). University of Crete, 2002.

[400]

D. Santos. Tense and Aspect in English and Portuguese: A Contrastive Semantical Study. PhD thesis, IST, Universidade Técnica de Lisboa, 1996. Supervised by L. Carlson and A. Sernadas.

[401]

P.-Y. Schobbens, G. Saake, A. Sernadas, and C. Sernadas. U2: A two-level temporal logic for evolving specifications. Information Processing Letters, 83(3):167-172, 2002.

[402]

L. Schröder and P. Mateus. Universal aspects of probabilistic automata. Mathematical Structures in Computer Science, 12(4):481-512, 2002.

[403]

A. Sernadas. Logical Procedure Definition for Information Systems Specification. PhD thesis, London School of Economics, University of London, 1980. Supervised by S. Waters.

[404]

A. Sernadas. Temporal aspects of logical procedure definition. Information Systems, 5(3):167-197, 1980.

[405]

A. Sernadas. Systematics: Its syntax and semantics as a query language I. Computer Journal, 24(1):56-61, 1981.

[406]

A. Sernadas. Systematics: Its syntax and semantics as a query language II. Computer Journal, 24(2):125-129, 1981.

[407]

A. Sernadas. Information systems specification with Infolog. In J. Hawgood, editor, Evolutionary Information Systems, pages 141-157. North Holland, 1982.

[408]

A. Sernadas. Introdução aos computadores e programação (Introduction to computers and programming). Revista Portuguesa de Informática, 3(2):35-43, 1982.

[409]

A. Sernadas. Book Review - Fibring Logics by Dov M. Gabbay. Journal of Logic, Language, and Information, 9(4):511-513, 2000.

[410]

A. Sernadas, J. Bubenko, and A. Olivè, editors. Theoretical and Formal Aspects of Information Systems. North-Holland, 1985.

[411]

A. Sernadas, J. F. Costa, and C. Sernadas. Object specification with diagrams: Oblog approach. Research report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 1992. In Portuguese. Awarded the Descartes Prize by the Data Processing Institute of the Ministry of Finances of Portugal.

[412]

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-Verlag, 1994.

[413]

A. Sernadas and H.-D. Ehrich. What is an object, after all? In R. Meersman, W. Kent, and S. Khosla, editors, Object Oriented Databases: Analysis, Design and Construction, pages 39-69. North-Holland, 1991.

[414]

A. Sernadas, H.-D. Ehrich, and J. F. Costa. From processes to objects. The INESC Journal of Research and Development, 1(1):7-27, 1990.

[415]

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-Verlag, 1989.

[416]

A. Sernadas, J. Fiadeiro, C. Sernadas, and H.-D. Ehrich. The basic building blocks of information systems. In E. Falkenberg and P. Lindgreen, editors, Information Systems Concepts: An In-Depth Analysis, pages 225-246. North-Holland, 1989.

[417]

A. Sernadas, G. Gaspar, and J. Granado. Bips: a layered predicative query language for a DBTG database system. In P. Scheuermann, editor, Improving Database Usability and Responsiveness, pages 73-93. Academic Press, 1982.

[418]

A. Sernadas, P. Mateus, and Y. Omar. Quantum computation and information. In M. S. Pereira, editor, A Portrait of State-of-the-Art Research at the Technical University of Lisbon, pages 46-65. Springer-Verlag, 2007.

[419]

A. Sernadas, J. Ramos, and P. Mateus. Linear algebra techniques for deciding the correctness of probabilistic programs with bounded resources. Preprint, SQIG - IT and IST - TU Lisbon, 1049-001 Lisboa, Portugal, 2008. Submitted for publication.

[420]

A. Sernadas, J. Ramos, and P. Mateus. Linear algebra techniques for deciding the correctness of probabilistic programs with bounded resources. Technical report, SQIG - Instituto de Telecomunicações, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 2008. Short paper presented at LPAR 2008, Doha, Qatar. November 22-27.

[421]

A. Sernadas and C. Sernadas. Capturing knowledge about the organization dynamics. In L. Methlie and R. Sprague, editors, Knowledge Representation for Decision Support Systems, pages 255-267. North Holland, 1985.

[422]

A. Sernadas and C. Sernadas. Conceptual modeling for knowledge-based DSS development. In C. Holsapple and A. Winston, editors, Decision Support Systems: Theory and Application, pages 91-135. Springer Verlag, 1985.

[423]

A. Sernadas and C. Sernadas. The use of ER abstractions for knowledge representation. In P. Chen, editor, Entity-relationship Approach, pages 224-231. IEEE CS Press / North Holland, 1985.

[424]

A. Sernadas and C. Sernadas. Abstraction and inference mechanisms for knowledge representation. In J. Schmidt and C. Thanos, editors, Foundations of Knowledge-Base Management, pages 91-111. Springer-Verlag, 1989.

[425]

A. Sernadas and C. Sernadas. Denotational semantics of object specification within an arbitrary temporal logic institution. Research report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 1993. Presented at IS-CORE Workshop 93.

[426]

A. Sernadas and C. Sernadas. Object certification. Research report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 1994. Presented at DAISD Workshop 94.

[427]

A. Sernadas and C. Sernadas. Theory spaces. Research report, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal, 1995. Presented at 11th ADT Workshop.

[428]

A. Sernadas and C. Sernadas. Combining logic systems: Why, how, what for? CIM Bulletin, 15:9-14, December 2003.

[429]

A. Sernadas and C. Sernadas. Foundations of Logic and Theory of Computation. College Publications, London, 2008. ISBN 978-1-904987-88-8.

[430]

A. Sernadas, C. Sernadas, and C. Caleiro. Synchronization of logics. Studia Logica, 59(2):217-247, 1997.

[431]

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-Verlag, 1997.

[432]

A. Sernadas, C. Sernadas, and C. Caleiro. Denotational semantics of object specification. Acta Informatica, 35:729-773, 1998.

[433]

A. Sernadas, C. Sernadas, and C. Caleiro. Fibring of logics as a categorial construction. Journal of Logic and Computation, 9(2):149-179, 1999.

[434]

A. Sernadas, C. Sernadas, C. Caleiro, and T. Mossakowski. Categorial fibring of logics with terms and binding operators. In D. Gabbay and M. de Rijke, editors, Frontiers of Combining Systems 2, pages 295-316. Research Studies Press, 2000.

[435]

A. Sernadas, C. Sernadas, and J. F. Costa. Object specification logic. Journal of Logic and Computation, 5(5):603-630, 1995.

[436]

A. Sernadas, C. Sernadas, and H.-D. Ehrich. Object-oriented specification of databases: an algebraic approach. In P. Hammersley, editor, Very Large Data Bases 87, pages 107-116. Morgan and Kaufmann, 1987.

[437]

A. Sernadas, C. Sernadas, and J. Ramos. A temporal logic approach to object certification. Data and Knowledge Engineering, 19:267-294, 1996.

[438]

A. Sernadas, C. Sernadas, J. Rasga, and M. Coniglio. Graph-theoretic fibring of logics Part I - Completeness. Preprint, SQIG - IT and IST - TU Lisbon, 1049-001 Lisboa, Portugal, 2008. Submitted for publication.

[439]

A. Sernadas, C. Sernadas, J. Rasga, and M. Coniglio. Graph-theoretic fibring of logics Part II - Completeness preservation. Preprint, SQIG - IT and IST - TU Lisbon, 1049-001 Lisboa, Portugal, 2008. Submitted for publication.

[440]

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-Verlag, 1995.

[441]

A. Sernadas, C. Sernadas, and A. Zanardo. Fibring modal first-order logics: Completeness preservation. Logic Journal of the IGPL, 10(4):413-451, 2002.

[442]

C. Sernadas. Multivariate Branching Processes. PhD thesis, London School of Economics, University of London, 1980. Supervised by D. Bartholomew.

[443]

C. Sernadas. Introdução à Teoria da Computação (An Introduction to Computing Theory). Editorial Presença, 1993.

[444]

C. Sernadas and R. Carapuça. The role of conceptual modeling abstractions in compiler development. Computer Journal, 30(4):328-336, 1987.

[445]

C. Sernadas, H. Coelho, and G. Gaspar. Communicating knowledge systems: Part i - big talk among small actors. Journal of Applied Artificial Intelligence, 1(3):233-260, 1987.

[446]

C. Sernadas, H. Coelho, and G. Gaspar. Communicating knowledge systems: Part ii - big talk among small actors. Journal of Applied Artificial Intelligence, 1(3):315-335, 1987.

[447]

C. Sernadas and J. Fiadeiro. Towards object-oriented conceptual modeling. Data and Knowledge Engineering, 6(6):479-508, 1991.

[448]

C. Sernadas, J. Fiadeiro, R. Meersman, and A. Sernadas. Proof-theoretic conceptual modeling: The NIAM case study. In E. Falkenberg and P. Lindgreen, editors, Information Systems Concepts: An In-Depth Analysis, pages 1-30. North-Holland, 1989.

[449]

C. Sernadas, J. Fiadeiro, and A. Sernadas. Modular construction of logic knowledge bases: An algebraic approach. Information Systems, 15(1):37-59, 1990.

[450]

C. Sernadas, J. Fiadeiro, and A. Sernadas. Object-oriented conceptual modeling from law. In R. Meersman, Z. Shi, and C.-H. Kung, editors, The Role of Artificial Intelligence in Databases and Information Systems, pages 305-327. North-Holland, 1990.

[451]

C. Sernadas, P. Gouveia, J. Gouveia, A. Sernadas, and P. Resende. The reification dimension in object-oriented data base design. In D. Harper and M. Norrie, editors, Specification of Database Systems, pages 275-299. Springer-Verlag, 1992.

[452]

C. Sernadas, P. Gouveia, and M. A. Lopes. Gentzen-type system for verification in conceptual modeling. In J. Göers, A. Heuer, and G. Saake, editors, Foundations of Models and Languages for Data and Objects, pages 215-228. TU Clausthal, 1991.

[453]

C. Sernadas, P. Gouveia, and A. Sernadas. Refinement: Layered definition of conceptual schemata. In E. Falkenberg, C. Rolland, and E. N. El-Sayed, editors, Information System Concepts, pages 19-51. North-Holland, 1992.

[454]

C. Sernadas, P. Gouveia, L. Silva, and M. A. Lopes. Objects as structuring units for incorporating dynamics in deductive conceptual modeling. In The Deductive Approach to Information Systems and Databases 90, pages 93-110. Universitat Politècnica de Catalunya, 1990.

[455]

C. Sernadas, P. Mendes, A. Hespanha, F. Santos, S. Mascarenhas, and A. Sernadas. An object-oriented representation of the dogmatics of omission to help in criminal law. In A. Martino, editor, Computers, Logic and Law, pages 781-809. Istituto per la Documentazione Giuridica, Pisa, Italy, 1989.

[456]

C. Sernadas, J. Rasga, and W. A. Carnielli. Modulated fibring and the collapsing problem. Journal of Symbolic Logic, 67(4):1541-1569, 2002.

[457]

C. Sernadas, P. Resende, P. Gouveia, and A. Sernadas. In-the-large object-oriented design of information systems. In F. Van Assche, B. Moulin, and C. Rolland, editors, The Object-Oriented Approach in Information Systems, pages 209-232. North-Holland, 1991.

[458]

C. Sernadas and A. Sernadas. Conceptual modeling abstraction mechanisms as parameterized theories in institutions. In R. Meersman and T. Steel, editors, Database Semantics, pages 121-140. North Holland, 1986.

[459]

C. Sernadas, L. Viganò, J. Rasga, and A. Sernadas. Truth-values as labels: A general recipe for labelled deduction. Journal of Applied Non-Classical Logics, 13(3-4):277-315, 2003.

[460]

L. Sheridan, N. Paunkovic, Y. Omar, and S. Bose. Discrete time quantum walk on a line with two particles. International Journal of Quantum Information, 4(3):573-583, 2006.

[461]

A. R. Silva. Serialização e paralelização (Serializability and parallelization). Master's thesis, IST, Universidade Técnica de Lisboa, 1991. Supervised by C. Sernadas.

[462]

J. Sousa, C. Sernadas, and A. Sernadas. An object-oriented specification tool for graphical interfaces. Computers and Graphics, 14(1):29-40, 1990.

[463]

R. Tagg and et al, editors. Query Language: A Unified Approach. Heyden and Son Ltd, 1981. A. Sernadas is one of the coeditors.

[464]

A. Vallecillo, V. Vasconcelos, and A. Ravara. Typing the behavior of software components using session types. Fundamenta Informaticae, 73(4):64-87, 2006. Full version of [465].

[465]

A. Vallecillo, V. T. Vasconcelos, and A. Ravara. Typing the behavior of objects and components using session types. Electronic Notes in Theoretical Computer Science, 68(3), 2003. Presented at FOCLASA'02.

[466]

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-Verlag, 2005.

[467]

F. van Breugel, C. Hermida, M. Makkai, and J. Worrell. Recursively defined metric spaces without contraction. Theoretical Computer Science, in print.

[468]

V. Vasconcelos and A. Ravara. Comunication errors in the pi-calculus are undecidable. Information Processing Letters, 71:229-233, 1999.

[469]

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-Verlag, 2004. Short version of [470].

[470]

V. T. Vasconcelos, A. Ravara, and S. Gay. Session types for functional multithreading. Theoretical Computer Science, 368(1-2):64-87, 2006. Full version of [469].

[471]

P. Zanardi and N. Paunkovic. Ground state overlap and quantum phase transitions. Physical Review E, 74:031123, 2006. ArXiv 0512249 [quant-ph].

[472]

A. Zanardo, A. Sernadas, and C. Sernadas. Fibring: Completeness preservation. Journal of Symbolic Logic, 66(1):414-439, 2001.