SCSS 2013: Keyword Index

KeywordPapers
a
algebraic numberLebesgue Constants and Optimal Node Systems via Symbolic Computations
automated verificationAutomated Verification of Equivalence on Quantum Cryptographic Protocols
b
BB84Automated Verification of Equivalence on Quantum Cryptographic Protocols
bottom-up semanticsA Condensed Goal-Independent Fixpoint Semantics Modeling the Small-Step Behavior of Rewriting
c
computational modelData Conversion Method between a Natural Number and a Binary Tree for an Inductive Proof and Its Application
computational origamiLogical and Algebraic Views of a Knot Fold of a Regular Heptagon
computer algebraComputer algebra investigation of known primitive triangle-free strongly regular graphs
d
DebuggingParametric Exploration of Rewriting Logic Computations
Distributed memory architectureA modified parallel F4 algorithm for shared and distributed memory architectures
e
elecronic cash protocolData Conversion Method between a Natural Number and a Binary Tree for an Inductive Proof and Its Application
equitable partitionsComputer algebra investigation of known primitive triangle-free strongly regular graphs
f
F4 algorithmA modified parallel F4 algorithm for shared and distributed memory architectures
formal methodsAutomated Verification of Equivalence on Quantum Cryptographic Protocols
g
Geometrical constraint solvingLogical and Algebraic Views of a Knot Fold of a Regular Heptagon
Groebner basisLebesgue Constants and Optimal Node Systems via Symbolic Computations
Gröbner basisA modified parallel F4 algorithm for shared and distributed memory architectures
i
induction schemeData Conversion Method between a Natural Number and a Binary Tree for an Inductive Proof and Its Application
invariantsUsage of Invariants for Symbolic Verification of Requirements
k
knot foldLogical and Algebraic Views of a Knot Fold of a Regular Heptagon
l
Lebesgue constantLebesgue Constants and Optimal Node Systems via Symbolic Computations
linear algebraGenerating Asymptotically Non-terminant Initial Variable Values for Linear Diagonalizable Programs.
m
MaudeParametric Exploration of Rewriting Logic Computations
MPIA modified parallel F4 algorithm for shared and distributed memory architectures
p
polynomial interpolationLebesgue Constants and Optimal Node Systems via Symbolic Computations
process calculiAutomated Verification of Equivalence on Quantum Cryptographic Protocols
program animationParametric Exploration of Rewriting Logic Computations
property-oriented specificationsAutomatic Inference of Term Equivalence in Term Rewriting Systems
q
quantifier eliminationLebesgue Constants and Optimal Node Systems via Symbolic Computations
quantum cryptographyAutomated Verification of Equivalence on Quantum Cryptographic Protocols
r
Requirements SpecificationUsage of Invariants for Symbolic Verification of Requirements
resultantLebesgue Constants and Optimal Node Systems via Symbolic Computations
rewriting logicParametric Exploration of Rewriting Logic Computations
s
semantics-based inference methodsAutomatic Inference of Term Equivalence in Term Rewriting Systems
SlicingParametric Exploration of Rewriting Logic Computations
static analysisGenerating Asymptotically Non-terminant Initial Variable Values for Linear Diagonalizable Programs.
steppingParametric Exploration of Rewriting Logic Computations
strongly regular graphsComputer algebra investigation of known primitive triangle-free strongly regular graphs
symbolic verificationUsage of Invariants for Symbolic Verification of Requirements
t
term rewritingA Condensed Goal-Independent Fixpoint Semantics Modeling the Small-Step Behavior of Rewriting
Term Rewriting SystemsAutomatic Inference of Term Equivalence in Term Rewriting Systems
A Condensed Goal-Independent Fixpoint Semantics Modeling the Small-Step Behavior of Rewriting
termination analysisGenerating Asymptotically Non-terminant Initial Variable Values for Linear Diagonalizable Programs.
theorem provingLogical and Algebraic Views of a Knot Fold of a Regular Heptagon
theorem proving methodsData Conversion Method between a Natural Number and a Binary Tree for an Inductive Proof and Its Application