FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

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

B
bisimulation	Compositional relational reasoning via operational game semantics
bounded model checking	From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques (Extended Abstract)
C
compact closed categories	Compositional Approaches to Games in Model Checking
compositionality	Compositional Approaches to Games in Model Checking
Contextual equivalence	From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques (Extended Abstract)
E
equivalence	Compositional relational reasoning via operational game semantics
Equivalence checking	Implementing a Path Based Equivalence Checker for Petri net based Models of Programs Regression verification of unbalanced recursive functions with multiple calls
Equivalence Prover	Generating Mutation Tests Using an Equivalence Prover
G
Game semantics	Compositional relational reasoning via operational game semantics
graphical language	Compositional Approaches to Games in Model Checking
L
lemma generation	Extending a Lemma Generation Approach for Rewriting Induction on Logically Constrained Term Rewriting Systems
M
mean payoff games	Compositional Approaches to Games in Model Checking
Mutation Testing	Generating Mutation Tests Using an Equivalence Prover
O
operational game semantics	From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques (Extended Abstract)
P
Parallelizing transformations	Implementing a Path Based Equivalence Checker for Petri net based Models of Programs
parity games	Compositional Approaches to Games in Model Checking
PRES+ model	Implementing a Path Based Equivalence Checker for Petri net based Models of Programs
Program equivalence	Extending a Lemma Generation Approach for Rewriting Induction on Logically Constrained Term Rewriting Systems
R
Recursive program	Regression verification of unbalanced recursive functions with multiple calls
rewriting induction	Extending a Lemma Generation Approach for Rewriting Induction on Logically Constrained Term Rewriting Systems
S
symbolic bisimulation	From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques (Extended Abstract)
Synchronization	Regression verification of unbalanced recursive functions with multiple calls
T
term rewriting	Extending a Lemma Generation Approach for Rewriting Induction on Logically Constrained Term Rewriting Systems
Test Case Generation	Generating Mutation Tests Using an Equivalence Prover
U
up-to techniques	From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques (Extended Abstract)

Disclaimer | Powered by EasyChair Smart Program