LCC info
- Individual analysis of cryptographic protocols
- Formal models for reversible computation; Measuring the degree of reversibility
- Descriptional Complexity of Regular Languages
- Cryptology and Security of Protocols
- Enumerative Combinatorics
- Anúncio de Bolsa
- Scholarship Announcement
- Scholarship -Project ASA
- Open Research Integration Scholarship - Project ASA
- <p> </p> <p> In the context of a research on Automata and Descriptional Complexity a research (integration) scholarship is now open.</p> <p>Please refer to the following announcement (Portuguese): <a title="Anúncio de Bolsa" class="internal-link" href="../Members/info/lcc-info/scholarship-project-asa">Scholarship Project ASA</a></p>
- State complexity approximation (Anfiteatro 2, DCC-FCUP Rua do Campo Alegre 1021 Porto, from Jun 26, 2009 03:00 PM to Jun 26, 2009 04:30 PM)
- Seminar by Prof. Sheng Yu from University of Western Ontario
- Open Research Scholarship -Project RESCUE
- A Research Grant position is available in the framework of project Rescue:: Reliable and Safe Code Execution for Embedded Systems, which aims at providing innovative, efficient and expressive mechanisms for the secure implementation and execution of code, with an emphasis on problems posed by embedded systems. The work will focus on the use of model checking based on timed-automata for ensure temporal properties of real-time systems.
- Scholarship -Project Rescue
