Talk Keyword Index

TALK KEYWORD INDEX

This page contains an index consisting of author-provided keywords.

Shortcuts: A C D F I K L M N P Q S T V

A
abstract DPLL	raSAT: SMT for Polynomial Inequality
affine arithmetic	raSAT: SMT for Polynomial Inequality
Array programs	Decision Procedures for Flat Array Properties
Arrays	Weakly Equivalent Arrays
C
channel capacity	Speeding Up SMT-Based Quantitative Program Analysis
constraint programming	Protocol log analysis with constraint programming
D
decision procedure	Weakly Equivalent Arrays
decision procedures	Decision Procedures for Flat Array Properties
F
first-order logic	Reasoning About Set Comprehensions
I
integer programming	Leveraging Linear and Mixed Integer Programming for SMT
interval arithmetic	raSAT: SMT for Polynomial Inequality
K
KLEE	Multi-solver Support in Symbolic Execution
L
lambda expressions	Extending SMT-LIB v2 with lambda-terms and polymorphism
linear arithmetic	Leveraging Linear and Mixed Integer Programming for SMT
linear real problems	Towards Conflict-Driven Learning for Virtual Substitution
M
model counting	Speeding Up SMT-Based Quantitative Program Analysis
models	Better Answers to Real Questions
monomorphization	Extending SMT-LIB v2 with lambda-terms and polymorphism
N
non-linear real arithmetic	Better Answers to Real Questions
P
parallel portfolio solver	Multi-solver Support in Symbolic Execution
performance evaluation	Multi-solver Support in Symbolic Execution
polymorphism	Extending SMT-LIB v2 with lambda-terms and polymorphism
polynomial constraints	raSAT: SMT for Polynomial Inequality
Q
quantifier elimination	Towards Conflict-Driven Learning for Virtual Substitution
quantifier-free	Weakly Equivalent Arrays
Quantifiers	Decision Procedures for Flat Array Properties
quantitative information flow	Speeding Up SMT-Based Quantitative Program Analysis
S
Set Comprehension	Reasoning About Set Comprehensions
set theory	Reasoning About Set Comprehensions
simplex	Leveraging Linear and Mixed Integer Programming for SMT
SMT	Leveraging Linear and Mixed Integer Programming for SMT Weakly Equivalent Arrays Reasoning About Set Comprehensions raSAT: SMT for Polynomial Inequality
SMT solving	Multi-solver Support in Symbolic Execution Towards Conflict-Driven Learning for Virtual Substitution
SMT-LIB	Extending SMT-LIB v2 with lambda-terms and polymorphism
symbolic execution	Multi-solver Support in Symbolic Execution
T
telecommunication protocol	Protocol log analysis with constraint programming
testing	Protocol log analysis with constraint programming raSAT: SMT for Polynomial Inequality
Theory of arrays	Decision Procedures for Flat Array Properties
typing	Extending SMT-LIB v2 with lambda-terms and polymorphism
V
veriT	Extending SMT-LIB v2 with lambda-terms and polymorphism
virtual substitution	Better Answers to Real Questions