Volume •Abstracts •Preface •Authors •Keywords •BibTex Entries

VPT 2013: Volume Information

VPT 2013. First International Workshop on Verification and Program Transformation

Editors: Alexei Lisitsa and Andrei Nemytykh

EPiC Series in Computing•Volume 16

10 articles•87 pages•Published: July 25, 2013

Papers

Ranking Functions for Linear-Constraint Loops

1-8

Transforming Undecidable Synthesis Problems into Decidable Problems

Bernd Finkbeiner

9

Acceleration For Presburger Petri Nets

10-12

Program Transformation for Program Verification

Alberto Pettorossi and Maurizio Proietti

13-14

Building trustworthy refactoring tools

15

Cryptographic Protocol Verification via Supercompilation (A Case Study)

Abdulbasit Ahmed, Alexei Lisitsa and Andrei Nemytykh

16-29

Verification of Imperative Programs through Transformation of Constraint Logic Programs

Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi and Maurizio Proietti

30-41

On the Termination of Positive Supercompilation

42-56

Transforming Event B Models into Verified C# Implementations

Dominique Mery and Rosemary Monahan

57-73

Ping-Pong Protocols as Prefix Grammars and Turchin Relation

Antonina Nepeivoda

74-87

Keyphrases

acceleration, algorithm, Constraint Logic Programming, correct-by-construction, cryptographic protocols², Erlang, Flatability, HaRe, Haskell, implementation, infinite-state systems, Petri nets, ping-pong protocols, Positive Supercompilation, prefix rewriting, Presburger, program analysis, program specialization, program transformation³, program verification², reachability, refactoring, refinement, supercompilation², termination, testing, tool, transformation, Turchin relation, unfold/fold transformations, vector addition systems, verification², Wrangler.