PDF Document

Source URL: www.ict.ac.cn

On the Co-Existence of Distributed and Centralized Routing Control-Planes Stefano Vissicchio∗ , Luca Cittadini‡ , Olivier Bonaventure∗ , Geoffrey G. Xie§ , Laurent Vanbever† ∗ Universit´e catholique de Louva

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

• Computing
• Routing protocols
• Data transmission
• Network architecture
• Computer networking
• Internet architecture
• Routing
• Internet protocols
• Router
• OpenFlow
• Enhanced Interior Gateway Routing Protocol
• Software-defined networking

Making Automatic Theorem Provers more Versatile Simon Cruanes University of Lorraine, CNRS, Inria, LORIA, 54000 Nancy, France Abstract We argue that automatic theorem provers should become more versatile and should be ab

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

• Theoretical computer science
• Software engineering
• Mathematical software
• Formal methods
• Logic in computer science
• Proof assistants
• Automated theorem proving
• Automated reasoning
• Satisfiability modulo theories
• E theorem prover
• ACL2
• Isabelle

Uniform Sampling for Timed Automata with Application to Language Inclusion Measurement? Benoˆıt Barbot1?? , Nicolas Basset1 , Marc Beunardeau2? ? ? , and Marta Kwiatkowska1 1

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

• Mathematical analysis
• Uniform distribution
• Limit of a function
• Timed automaton
• Differential calculus
• BKL singularity

Selection Functions Quality Selections Lookahead Selection

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

• Propositional calculus
• Logic
• Mathematical logic
• Mathematics
• Logic programming
• Rules of inference
• Statistical theory
• Literal
• Resolution
• Clause
• Completeness

Verified Computations Using Taylor Models and Their Applications Kyoko Makino and Martin Berz Department of Physics and Astronomy Michigan State University

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

• Latin script
• Character encoding
• Digital typography
• Circumflex
• Writing
• Notation
• French Braille
• World glyph set

Symbolic Verification and Strategy Synthesis for Linearly-Priced Probabilistic Timed Automata Marta Kwiatkowska1 , Gethin Norman2 , and David Parker3 1 Department of Computer Science, University of Oxford, Oxford, UK

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

• Dynamic programming
• Markov decision process
• Stochastic control
• Symbol
• Timed automaton
• Probability and statistics
• Probability
• Approximation algorithms
• Computational complexity theory

Building Power Consumption Models from Executable Timed I/O Automata Specifications ∗ Benoît Barbot , Marta Kwiatkowska, Alexandru Mereacre and Nicola Paoletti Department of Computer Science, University of Oxford, UK

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

A Tutorial on Runtime Verification Yli`es FALCONE a , Klaus HAVELUND b,1 and Giles REGER c,2 a University of Grenoble I (UJF), Laboratoire d’Informatique de Grenoble, France b Jet Propulsion Laboratory, California Inst

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

• Software development
• Aspect-oriented software development
• Aspect-oriented programming
• Formal methods
• Logic in computer science
• Runtime verification
• Pointcut
• Formal verification
• Join point
• Instrumentation

iBGP Deceptions: More Sessions, Fewer Routes Stefano Vissicchio†§ Luca Cittadini† Laurent Vanbever‡ Olivier Bonaventure‡ † Roma Tre University § GARR Consortium ‡ Universit´e catholique de Louvain † {vis

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

• Computing
• Internet architecture
• Network architecture
• Information and communications technology
• Routing
• Computer networking
• Internet Standards
• Route reflector
• Border Gateway Protocol
• BGP confederation
• Router
• Control plane