The aim of this core area is to provide the students with, on the one hand, the basic concepts within the area of Logic in Computer Science and Programming, and, on the other hand, a deeper knowledge on current topics in the research area, witch allows them to develop a PhD thesis.

This graduate line offers four courses. The mandatory ones introduce the basic necessary concepts in the area for any student who wants to develop the PhD thesis within the graduate line. The optional ones present several specific research specific research topics within the graduate line.

Core area coordinator: Albert Rubio (rubio@lsi.upc.es).
 

Mandatory courses:

Theory of Programming
Foundations in Logic and Algebra.
 

Optional courses:

Specification, Deduction and Verification.
Declarative Programming
 
 
 
 

COURSES DESCRIPTION
 
 

57025 Theory of Programming
Course/Seminar: course
Credit: 4
Semester: first
Course: 1999/00
Lecturer in charge: Levy Díaz, Jordi

In this course, basic concepts and tools in programming language semantics, like fix point theory or domain theory, are presented.
 
 

57038 Foundations in Logic and Algebra
Course/Seminar: course
Credit: 4
Semester: first
Course: 1999/00
Lecturer in charge: Nieuwenhuis, Roberto

In this course we present basic concepts and technics in logic and algebra, which are needed for the following courses in the graduate line.
 
 

57039 Specification, Deduction and Verification
Course/Seminar: course
Credit: 4
Semester: second
Course: 1999/00
Lecturer in charge: Cortadella Fortuny, Jordi

Formal specification methods for system design. (Semi-)automatic deduction methods for the various specification formalisms. Aplications to system verification and design.
Recomendation: To have attended to Foundations in Logic and Algebra course.
 
 

57040 Declarative Programming
Course/Seminar: course
Credit: 4
Semester: second
Course: 1999/00
Lecturer in charge: Rubio Gimeno, Albert

Functional programming, logic programming, functional-logic programming, constraint logic programming, constraint programming. Implementation issues: term and graph rewriting, the Warren Abstract Machine (WAM), etc.
Recomendation: To have attended to Foundations in Logic and Algebra course.