We know (nearly) nothing! But can we learn? ? Stephan Schulz

Source URL: www.cs.man.ac.uk

Language and Hardware Acceleration Backend for Graph Processing Andrey Mokhov† , Alessandro de Gennaro† , Ghaith Tarawneh† , Jonny Wray‡ , Georgy Lukyanov† , Sergey Mileiko† , Joe Scott† , Alex Yakovlev†

Source URL: www.staff.ncl.ac.uk

• Graph theory
• Mathematics
• Discrete mathematics
• Graph traversal
• Graph
• Directed graph
• Breadth-first search
• Degree
• Line graph
• Clique

SC2 challenges: when Satisfiability Checking and Symbolic Computation join forces James H. Davenport, Pascal Fontaine, Alberto Griggio (and the others partners whose details wouldn’t fit)1 University of Bath, LORIA, Fo

Source URL: staff.bath.ac.uk

• Theoretical computer science
• Logic
• Logic in computer science
• Mathematics
• Electronic design automation
• Formal methods
• NP-complete problems
• Boolean algebra
• Boolean satisfiability problem
• Uninterpreted function
• Satisfiability
• Solver

Numerical quality: an industrial case study on code_aster Numerical Software Verication

Source URL: www.cs.ox.ac.uk

• Computing
• Computational science
• Software engineering
• Applied mathematics
• Numerical analysis
• Alternatives to animal testing
• Computer simulation
• Scientific modeling
• Virtual reality
• Numerical modeling
• Simulation
• Numerical stability

Automated Quantitative Software Verification by Mark Kattenbelt A thesis submitted for the degree of

Source URL: qav.comlab.ox.ac.uk

• Model checkers
• Model checking
• Abstraction
• Mathematical proof
• Economic model
• Verification
• Theoretical computer science
• Formal methods
• Cognitive science
• Computing
• PRISM model checker
• Construction and Analysis of Distributed Processes

1 Computing Minimal Update Sequences for Graceful Router-wide Reconfigurations Francois Clad1 , Stefano Vissicchio2 , Pascal Mérindol1 , Pierre Francois3 and Jean-Jacques Pansiot1 1

Source URL: www0.cs.ucl.ac.uk

• Computing
• Routing protocols
• Data transmission
• Network architecture
• Internet architecture
• Internet Standards
• Internet protocols
• Routing algorithms
• Constraint
• Open Shortest Path First
• Link-state routing protocol
• Router

Technical Report On the Mathematical Properties of Monadic Stream Functions 1.

Source URL: www.cs.nott.ac.uk

• Software engineering
• Computer programming
• Mathematics
• Spectral theory
• Computability theory
• Lambda calculus
• Theoretical computer science
• Monad
• Continuous function
• Function composition
• Spectral theory of ordinary differential equations
• Jordan normal form

Tobias Nipkow Programming and Proving in Isabelle/HOL le l

Source URL: www.cl.cam.ac.uk

• Type theory
• Theoretical computer science
• Proof assistants
• Mathematical logic
• Programming language theory
• Formal methods
• Lambda calculus
• Logic in computer science
• Isabelle
• HOL
• HindleyMilner type system
• Automated theorem proving

Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗

Source URL: www.doc.ic.ac.uk

• Theoretical computer science
• Theory of computation
• Computability theory
• Mathematics
• Turing machine
• Alan Turing
• Models of computation
• Ambient calculus
• Turing completeness
• Halting problem
• Computability
• Reduction

IGP-as-a-Backup for Robust SDN Networks Olivier Tilmans Stefano Vissicchio Universit´e catholique de Louvain

Source URL: www0.cs.ucl.ac.uk