Team, Visitors, External Collaborators
Overall Objectives
Research Program
Application Domains
Highlights of the Year
New Software and Platforms
New Results
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Dissemination
Bibliography
XML PDF e-pub
PDF e-Pub


2018 Project-Team Activity Report
GALLIUM
Programming languages, types, compilation and proofs
Research centre: Paris

Field: Algorithmics, Programming, Software and Architecture
Theme: Proofs and Verification
Keywords:
Computer Science and Digital Science:
  • A1.1.1. - Multicore, Manycore
  • A1.1.3. - Memory models
  • A2.1. - Programming Languages
  • A2.1.1. - Semantics of programming languages
  • A2.1.3. - Object-oriented programming
  • A2.1.4. - Functional programming
  • A2.1.6. - Concurrent programming
  • A2.1.11. - Proof languages
  • A2.2. - Compilation
  • A2.2.1. - Static analysis
  • A2.2.2. - Memory models
  • A2.2.4. - Parallel architectures
  • A2.2.5. - Run-time systems
  • A2.4. - Formal method for verification, reliability, certification
  • A2.4.1. - Analysis
  • A2.4.3. - Proofs
  • A2.5.4. - Software Maintenance & Evolution
  • A7.1.2. - Parallel algorithms
  • A7.2. - Logic in Computer Science
  • A7.2.2. - Automated Theorem Proving
  • A7.2.3. - Interactive Theorem Proving
Other Research Topics and Application Domains:
  • B5.2.3. - Aviation
  • B6.1. - Software industry
  • B6.6. - Embedded systems
  • B9.5.1. - Computer science