Difference between revisions of "Internship subjects"
Radu iosif (Talk | contribs) (Created page with "The following internships can be continued with a PhD thesis on already acquired funding: * Local Reasoning about Reconfigurable Component-based Systems (Master level, 6 mon...") |
Radu iosif (Talk | contribs) |
||
| (17 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| − | |||
| − | * Local Reasoning about Reconfigurable Component-based Systems | + | == PhD subjects == |
| − | * Verifying Concurrent Systems with Automata over Infinite Alphabets | + | |
| + | |||
| + | * [http://nts.imag.fr/images/5/58/Reconfiguration.pdf Proving Correctness of Reconfigurable Systems] | ||
| + | |||
| + | The goal of this PhD project is the development of a rigourous design framework for distributed systems, that uses verification from the early stages of model building. Formal verification is the process of transforming a query about the correctness of a system (e.g. is every store request to a cloud treated by storing the data in such a way that any future retrieval request will eventually find it?) into a logical validity query (is a given formula true in general?) that can be handled by automated reasoning techniques (theorem proving). Hence, we recognise logic, automated reasoning and model checking as being the main ingredients of formal verification, and also central research topics in our project. | ||
| + | |||
| + | |||
| + | == Internship subjects == | ||
| + | |||
| + | |||
| + | * [http://nts.imag.fr/images/8/85/ArchitectureSeparationLogic.pdf Local Reasoning about Reconfigurable Component-based Systems] | ||
| + | |||
| + | The goal of this internship is the study of logics for the design and verification of complex component-based distributed applications, using the principles of locality (the ability to describe the effect of an update only from the parts involved while gnoring the ones unchanged) and compositionality (the ability to join the results of local analyses into a global condition capturing the correctness requirement for the entire system). During this internship, the candidate will aquire command of advanced theoretical notions of logics and system verification. The internship comprises theoretical as well as implementation work. | ||
| + | |||
| + | * [http://nts.imag.fr/images/5/5e/InfiniteAlphabetAutomata.pdf Verifying Concurrent Systems with Automata over Infinite Alphabets] | ||
| + | |||
| + | The goal of this internship is to study extensions of finite-state automata over infinite alphabets and apply them to the verification of concurrent and distributed systems with unbounded numbers of threads. The internship comprises theoretical as well as implementation work, and will explore orthogonal domains, such as logic, automata theory and concurrency. | ||
| + | |||
| + | * [http://nts.imag.fr/images/3/32/SeparationLogicEntailmentChecking.pdf Decision Procedures for Separation Logic Modulo Theories of Data] | ||
| + | |||
| + | The goal of this internship is to study the combination of Separation Logic with data theories supported by SMT solvers. The internship comprises theoretical as well as implementation work. | ||
Latest revision as of 09:40, 12 May 2021
PhD subjects
The goal of this PhD project is the development of a rigourous design framework for distributed systems, that uses verification from the early stages of model building. Formal verification is the process of transforming a query about the correctness of a system (e.g. is every store request to a cloud treated by storing the data in such a way that any future retrieval request will eventually find it?) into a logical validity query (is a given formula true in general?) that can be handled by automated reasoning techniques (theorem proving). Hence, we recognise logic, automated reasoning and model checking as being the main ingredients of formal verification, and also central research topics in our project.
Internship subjects
The goal of this internship is the study of logics for the design and verification of complex component-based distributed applications, using the principles of locality (the ability to describe the effect of an update only from the parts involved while gnoring the ones unchanged) and compositionality (the ability to join the results of local analyses into a global condition capturing the correctness requirement for the entire system). During this internship, the candidate will aquire command of advanced theoretical notions of logics and system verification. The internship comprises theoretical as well as implementation work.
The goal of this internship is to study extensions of finite-state automata over infinite alphabets and apply them to the verification of concurrent and distributed systems with unbounded numbers of threads. The internship comprises theoretical as well as implementation work, and will explore orthogonal domains, such as logic, automata theory and concurrency.
The goal of this internship is to study the combination of Separation Logic with data theories supported by SMT solvers. The internship comprises theoretical as well as implementation work.
