Home
EPiC Series
Kalpa Publications
Preprints
For Authors
For Editors
Volume
•
Abstracts
•
Preface
•
Authors
•
Keywords
•
BibTex Entries
VPT 2013: Keyword Index
Keyword
Papers
a
acceleration
Acceleration For Presburger Petri Nets
algorithm
Transforming Event B Models into Verified C# Implementations
c
Constraint Logic Programming
Verification of Imperative Programs through Transformation of Constraint Logic Programs
correct-by-construction
Transforming Event B Models into Verified C# Implementations
cryptographic protocols
Cryptographic Protocol Verification via Supercompilation (A Case Study)
Ping-Pong Protocols as Prefix Grammars and Turchin Relation
e
Erlang
Building trustworthy refactoring tools
f
Flatability
Acceleration For Presburger Petri Nets
h
HaRe
Building trustworthy refactoring tools
Haskell
Building trustworthy refactoring tools
i
implementation
Transforming Event B Models into Verified C# Implementations
infinite-state systems
Acceleration For Presburger Petri Nets
p
Petri nets
Acceleration For Presburger Petri Nets
ping-pong protocols
Ping-Pong Protocols as Prefix Grammars and Turchin Relation
Positive Supercompilation
On the Termination of Positive Supercompilation
prefix rewriting
Ping-Pong Protocols as Prefix Grammars and Turchin Relation
Presburger
Acceleration For Presburger Petri Nets
program analysis
Cryptographic Protocol Verification via Supercompilation (A Case Study)
program specialization
Cryptographic Protocol Verification via Supercompilation (A Case Study)
program transformation
Cryptographic Protocol Verification via Supercompilation (A Case Study)
Verification of Imperative Programs through Transformation of Constraint Logic Programs
On the Termination of Positive Supercompilation
program verification
Cryptographic Protocol Verification via Supercompilation (A Case Study)
Verification of Imperative Programs through Transformation of Constraint Logic Programs
r
reachability
Acceleration For Presburger Petri Nets
refactoring
Building trustworthy refactoring tools
refinement
Transforming Event B Models into Verified C# Implementations
s
supercompilation
Cryptographic Protocol Verification via Supercompilation (A Case Study)
Ping-Pong Protocols as Prefix Grammars and Turchin Relation
t
termination
On the Termination of Positive Supercompilation
testing
Building trustworthy refactoring tools
tool
Building trustworthy refactoring tools
transformation
Transforming Event B Models into Verified C# Implementations
Turchin relation
Ping-Pong Protocols as Prefix Grammars and Turchin Relation
u
unfold/fold transformations
Verification of Imperative Programs through Transformation of Constraint Logic Programs
v
vector addition systems
Acceleration For Presburger Petri Nets
verification
Building trustworthy refactoring tools
Transforming Event B Models into Verified C# Implementations
w
Wrangler
Building trustworthy refactoring tools
Copyright © 2012-2024 easychair.org. All rights reserved.