Talk Keyword Index

TALK KEYWORD INDEX

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

Shortcuts: A C D E F G I M N O P R S T V

A
Ada programming	Verification of Ada Programs with AdaHorn
C
call-by-need evaluation	Optimizing Space of Parallel Processes
Constrained Horn Clauses	Verification of Ada Programs with AdaHorn
constrained rewriting	On Transforming Functions Accessing Global Variables into Logically Constrained Term Rewriting Systems
contextual equivalence	Automating the Diagram Method to Prove Correctness of Program Transformations
correctness	Automating the Diagram Method to Prove Correctness of Program Transformations
D
deduction	Automating the Diagram Method to Prove Correctness of Program Transformations
E
Eldarica	Verification of Ada Programs with AdaHorn
F
functional programming	Optimizing Space of Parallel Processes
G
GNATProve	Verification of Ada Programs with AdaHorn
I
imperative programs	On Transforming Functions Accessing Global Variables into Logically Constrained Term Rewriting Systems
M
model checking	Verification of Ada Programs with AdaHorn
N
narrowing	On Transforming Narrowing Trees into Regular Tree Grammars Generating Ranges of Substitutions
O
observational equivalence	Automating the Diagram Method to Prove Correctness of Program Transformations
operational semantics	Reducing Total Correctness to Partial Correctness by a Transformation of the Language Semantics
P
parallel improvements	Optimizing Space of Parallel Processes
partial correctness	Reducing Total Correctness to Partial Correctness by a Transformation of the Language Semantics
PDR-Z3	Verification of Ada Programs with AdaHorn
program transformation	On Transforming Functions Accessing Global Variables into Logically Constrained Term Rewriting Systems Reducing Total Correctness to Partial Correctness by a Transformation of the Language Semantics Automating the Diagram Method to Prove Correctness of Program Transformations
Program Verification	Verification of Ada Programs with AdaHorn Reducing Total Correctness to Partial Correctness by a Transformation of the Language Semantics
R
reachability	On Transforming Narrowing Trees into Regular Tree Grammars Generating Ranges of Substitutions
reachability logic	Reducing Total Correctness to Partial Correctness by a Transformation of the Language Semantics
regular tree grammar	On Transforming Narrowing Trees into Regular Tree Grammars Generating Ranges of Substitutions
S
semantics	Automating the Diagram Method to Prove Correctness of Program Transformations
static analyzers	Verification of Ada Programs with AdaHorn
T
term rewriting	On Transforming Narrowing Trees into Regular Tree Grammars Generating Ranges of Substitutions
termination	Reducing Total Correctness to Partial Correctness by a Transformation of the Language Semantics
total correctness	Reducing Total Correctness to Partial Correctness by a Transformation of the Language Semantics
V
Verification	Automating the Diagram Method to Prove Correctness of Program Transformations