Difference between revisions of "Phd and internship subjects"

From Numerical Transition Systems
Jump to: navigation, search
(5 intermediate revisions by the same user not shown)
Line 1: Line 1:
 
 
== PhD subjects ==
 
== PhD subjects ==
 
  
* [http://nts.imag.fr/images/5/58/Reconfiguration.pdf Proving Correctness of Reconfigurable Systems]
+
* [http://nts.imag.fr/images/d/d7/SelfAdaptingLogicsPhd.pdf Logical Foundations of Self-Adapting Distributed 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.
+
Reconfiguration is an inherent aspect of modern distributed systems, such as clouds or IoT. Processes can be created or removed due to internal faults, redistribution of resources, workload or traffic changes. Moreover, the shape of the communication network may change. Self-adapting systems initiate and carry out reconfiguration sequences automatically, in order to avoid expensive or even mission-critical downtimes, required by manual reconfiguration. The successful candidate will develop logics and automated reasoning techniques that enable writing formal proofs of correctness of self-adapting distributed systems. We focus on logics that describe the shape of a network (i.e., the interconnection of processes via communication channels) and how this shape changes with time. Particular attention will be devoted to the implementation of practical verification tools based on automated theorem proving and model checking based on the logics developped in this thesis. To this end, the candidate is expected to work on implementation and prototyping, in addition to theoretical research.
 
+
* [http://nts.imag.fr/images/2/25/SepLogDataPhD.pdf Decision Procedures for Inductive Separation Logic Modulo Data Theories]
+
 
+
The goal of this PhD project is to devise a decision procedure for Separation Logic with user-provided inductive definitions of predicates. We intend to find a procedure that is optimal from a theoretical point of view, practically efficient, and able to handle a class of definitions that is as large as possible, combining spatial reasoning (to reason on the shape of the considered data structures) with data theory reasoning based on external tools (to take into account the properties of the data stored inside the structure).
+
  
 
== Internship subjects ==
 
== Internship subjects ==
 
   
 
   
 +
* [https://nts.imag.fr/images/8/8a/MSOBTW.pdf A Solver for Monadic Second Order Logic of Graphs of Bounded Tree-width]
  
* [http://nts.imag.fr/images/8/85/ArchitectureSeparationLogic.pdf Local Reasoning about Reconfigurable Component-based Systems]
+
The goal of this internship is to first try the direct implementation
 
+
that follows Courcelle's proof, identity its bottlenecks and, second,
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.  
+
devises solutions by generating more compact MSO formulae over
 +
trees, that postpone (or even avoid) state explosion, in some cases.  
  
 
* [http://nts.imag.fr/images/5/5e/InfiniteAlphabetAutomata.pdf Verifying Concurrent Systems with Automata over Infinite Alphabets]  
 
* [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.
 
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.
 

Revision as of 17:44, 27 October 2023

PhD subjects

Reconfiguration is an inherent aspect of modern distributed systems, such as clouds or IoT. Processes can be created or removed due to internal faults, redistribution of resources, workload or traffic changes. Moreover, the shape of the communication network may change. Self-adapting systems initiate and carry out reconfiguration sequences automatically, in order to avoid expensive or even mission-critical downtimes, required by manual reconfiguration. The successful candidate will develop logics and automated reasoning techniques that enable writing formal proofs of correctness of self-adapting distributed systems. We focus on logics that describe the shape of a network (i.e., the interconnection of processes via communication channels) and how this shape changes with time. Particular attention will be devoted to the implementation of practical verification tools based on automated theorem proving and model checking based on the logics developped in this thesis. To this end, the candidate is expected to work on implementation and prototyping, in addition to theoretical research.

Internship subjects

The goal of this internship is to first try the direct implementation that follows Courcelle's proof, identity its bottlenecks and, second, devises solutions by generating more compact MSO formulae over trees, that postpone (or even avoid) state explosion, in some cases.

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.