Scalable Integrated Performance Analysis of Multi-Gigabit Networks ∗ Ezra Kissel∗ , Ahmed El-Hassany† , Guilherme Fernandes† , Martin Swany† , Dan Gunter‡ , Taghrid Samak‡ , Jennifer M. Schopf§

Source URL: people.ee.ethz.ch

NetSpectre: Read Arbitrary Memory over Network Michael Schwarz Martin Schwarzl Graz University of Technology

Source URL: mlq.me

• Computer hardware
• Computer architecture
• Computing
• Side-channel attacks
• Computer security
• X86 architecture
• Central processing unit
• Computer memory
• Spectre
• Microarchitecture
• CPU cache
• Meltdown

Termgraph Rewriting Maria Schett Supervisors: Martin Avanzini, Georg Moser November 8, 2011

Source URL: www.maria-a-schett.net

• Theoretical computer science
• Programming language theory
• Mathematics
• Formal languages
• Mathematical logic
• Logic in computer science
• Computability theory
• Rewriting
• Normal form
• Graph rewriting
• Pure
• Term

Predicate Abstraction for Relaxed Memory Models Andrei Dan Martin Vechev

Source URL: practicalsynthesis.github.io

• Logic
• Mathematical logic
• Linguistics
• Dekker's algorithm
• Edsger W. Dijkstra
• Predicate
• Flag

Instantiation for Theory Reasoning in Vampire Giles Reger Martin Riener

Source URL: www.logic.at

• Mathematical logic
• Logic
• Mathematics
• Axioms of set theory
• 1Q
• Axiom

SC2 challenges: when Satisfiability Checking and Symbolic Computation join forces ´ Erika Abrah´ am1 , John Abbott10 , Bernd Becker2 , Anna M. Bigatti3 , Martin Brain9 , Alessandro Cimatti4 , James H. Davenport5 ,

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

• Theoretical computer science
• Logic in computer science
• Computational complexity theory
• Formal methods
• Mathematics
• Electronic design automation
• NP-complete problems
• Constraint programming
• Satisfiability modulo theories
• Boolean satisfiability problem
• Solver
• Model checking

Rigorous Reachability Analysis and Domain Decomposition of Taylor Models Martin Berz and Kyoko Makino Department of Physics and Astronomy Michigan State University

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

• Numerical methods for ordinary differential equations
• Domain decomposition methods
• Numerical analysis
• Numerical software
• Mathematical analysis
• PROPT

Defining (Co)datatypes and Primitively (Co)recursive Functions in Isabelle/HOL Julian Biendarra, Jasmin Christian Blanchette, Martin Desharnais, Lorenz Panny, Andrei Popescu, and Dmitriy Traytel 15 August 2018

Source URL: isabelle.in.tum.de

• Computer programming
• Software engineering
• Computing
• Recursion
• Type theory
• Data types
• Theoretical computer science
• Functional programming
• Recursive data type
• Inductive data type
• Corecursion
• Mutual recursion

Abduction by Non-Experts Nikolaj Bjørner2 , Dejan Jovanovi´c1 , Tancr`ede Lepoint1 , Philipp R¨ ummer3 , and 1 Martin Sch¨af 1

Source URL: csl.sri.com

• Theoretical computer science
• Logic in computer science
• Mathematical logic
• Computational complexity theory
• Electronic design automation
• Formal methods
• NP-complete problems
• Constraint programming
• Satisfiability modulo theories
• Horn clause
• Clause
• Logic programming

Playing with AVATAR Giles Reger, Martin Suda and Andrei Voronkov ? University of Manchester, Manchester, UK Abstract. Modern first-order resolution and superposition theorem provers use saturation algorithms to search fo

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

• Theoretical computer science
• Automated theorem proving
• Mathematics
• Mathematical logic
• Formal methods
• Logic in computer science
• Resolution
• Logic programming
• Clause
• Vampire
• Boolean satisfiability problem
• CARINE