VPT 2013: Keyword Index

KeywordPapers
a
accelerationAcceleration For Presburger Petri Nets
algorithmTransforming Event B Models into Verified C# Implementations
c
Constraint Logic ProgrammingVerification of Imperative Programs through Transformation of Constraint Logic Programs
correct-by-constructionTransforming Event B Models into Verified C# Implementations
cryptographic protocolsCryptographic Protocol Verification via Supercompilation (A Case Study)
Ping-Pong Protocols as Prefix Grammars and Turchin Relation
e
ErlangBuilding trustworthy refactoring tools
f
FlatabilityAcceleration For Presburger Petri Nets
h
HaReBuilding trustworthy refactoring tools
HaskellBuilding trustworthy refactoring tools
i
implementationTransforming Event B Models into Verified C# Implementations
infinite-state systemsAcceleration For Presburger Petri Nets
p
Petri netsAcceleration For Presburger Petri Nets
ping-pong protocolsPing-Pong Protocols as Prefix Grammars and Turchin Relation
Positive SupercompilationOn the Termination of Positive Supercompilation
prefix rewritingPing-Pong Protocols as Prefix Grammars and Turchin Relation
PresburgerAcceleration For Presburger Petri Nets
program analysisCryptographic Protocol Verification via Supercompilation (A Case Study)
program specializationCryptographic Protocol Verification via Supercompilation (A Case Study)
program transformationCryptographic Protocol Verification via Supercompilation (A Case Study)
Verification of Imperative Programs through Transformation of Constraint Logic Programs
On the Termination of Positive Supercompilation
program verificationCryptographic Protocol Verification via Supercompilation (A Case Study)
Verification of Imperative Programs through Transformation of Constraint Logic Programs
r
reachabilityAcceleration For Presburger Petri Nets
refactoringBuilding trustworthy refactoring tools
refinementTransforming Event B Models into Verified C# Implementations
s
supercompilationCryptographic Protocol Verification via Supercompilation (A Case Study)
Ping-Pong Protocols as Prefix Grammars and Turchin Relation
t
terminationOn the Termination of Positive Supercompilation
testingBuilding trustworthy refactoring tools
toolBuilding trustworthy refactoring tools
transformationTransforming Event B Models into Verified C# Implementations
Turchin relationPing-Pong Protocols as Prefix Grammars and Turchin Relation
u
unfold/fold transformationsVerification of Imperative Programs through Transformation of Constraint Logic Programs
v
vector addition systemsAcceleration For Presburger Petri Nets
verificationBuilding trustworthy refactoring tools
Transforming Event B Models into Verified C# Implementations
w
WranglerBuilding trustworthy refactoring tools