FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

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

A
almost-sat	Structural Parameter Based Parallel Algorithms for Partially Weighted MaxSAT
automated theorem proving	Goéland : A Concurrent Tableau-Based Theorem Prover
B
benchmarking	Beyond Portfolios of Stable Solvers
branching bisimulation	A Linear Parallel Algorithm to Compute Strong and Branching Bisimilarity
C
clause sharing	Leveraging GPUs for Parallel SAT Solving
concurrency	Goéland : A Concurrent Tableau-Based Theorem Prover
Concurrent Separation Logic	Isabelle LLVM Parallel
cube-and-conquer	Dealing With Uncertainty Between Peers and Having the Best of Times With Distributed Systems
F
fixed-parameter tractability	Structural Parameter Based Parallel Algorithms for Partially Weighted MaxSAT
G
GPU	Leveraging GPUs for Parallel SAT Solving
I
incremental CDCL	Dealing With Uncertainty Between Peers and Having the Best of Times With Distributed Systems
Isabelle	Isabelle LLVM Parallel
L
Labelled Transition Systems	A Linear Parallel Algorithm to Compute Strong and Branching Bisimilarity
LLVM	Isabelle LLVM Parallel
M
max-sat	Structural Parameter Based Parallel Algorithms for Partially Weighted MaxSAT
P
parallel algorithms	Structural Parameter Based Parallel Algorithms for Partially Weighted MaxSAT
Parallel Sorting Algorithms	Isabelle LLVM Parallel
portfolios	Beyond Portfolios of Stable Solvers
PRAM	A Linear Parallel Algorithm to Compute Strong and Branching Bisimilarity
R
Refinement	Isabelle LLVM Parallel
S
SAT solving	Leveraging GPUs for Parallel SAT Solving Dealing With Uncertainty Between Peers and Having the Best of Times With Distributed Systems Beyond Portfolios of Stable Solvers
strong bisimulation	A Linear Parallel Algorithm to Compute Strong and Branching Bisimilarity
T
Tableaux	Goéland : A Concurrent Tableau-Based Theorem Prover

Disclaimer | Powered by EasyChair Smart Program