WPTE Extended Abstracts: Keyword Index

WPTE EXTENDED ABSTRACTS: KEYWORD INDEX

Papers Papers with Abstracts Author Index Keyword Index

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