Sergei M. Abramov & Robert Glück (2000):
Combining semantics with non-standard interpreter hierarchies.
In: Sanjiv Kapoor & Sanjiva Prasad: Foundations of Software Technology and Theoretical Computer Science. Proceedings,
LNCS 1974.
Springer-Verlag,
pp. 201–213,
doi:10.1007/3-540-44450-5_16.
Abdulbasit Ahmed, Alexei P. Lisitsa & Andrei P. Nemytykh (2013):
Cryptographic protocol verification via supercompilation (a case study).
In: Alexei P. Lisitsa & Andrei P. Nemytykh: Verification and Program Transformation. Proceedings,
EPiC Series in Computing 16,
pp. 16–29,
doi:10.29007/gpsh.
Alfred V. Aho, John E. Hopcroft & Jeffrey D. Ullman (1968):
Time and tape complexity of pushdown automaton languages.
Information and Control 13(3),
pp. 186–206,
doi:10.1016/S0019-9958(68)91087-5.
Rajeev Alur, Ahmed Bouajjani & Javier Esparza (2018):
Model checking procedural programs.
In: Edmund M. Clarke, Thomas A. Henzinger, Helmut Veith & Roderick Bloem: Handbook of Model Checking.
Springer-Verlag.
To appear.
Holger B. Axelsen & Robert Glück (2011):
What do reversible programs compute?.
In: Martin Hofmann: Foundations of Software Science and Computation Structures. Proceedings,
LNCS 6604.
Springer-Verlag,
pp. 42–56,
doi:10.1007/978-3-642-19805-2_4.
Stephen A. Cook (1972):
Linear time simulation of deterministic two-way pushdown automata.
In: Charles V. Freiman, John E. Griffith & Jack L. Rosenfeld: Information Processing 71.
North-Holland,
pp. 75–80.
Danny Dolev, Shimon Even & Richard M. Karp (1982):
On the security of ping-pong protocols.
Information and Control 55(1-3),
pp. 57–68,
doi:10.1016/S0019-9958(82)90401-6.
Danny Dolev & Andrew C. Yao (1981):
On the security of public key protocols (extended abstract).
In: Foundations of Computer Science. Proceedings.
IEEE Computer Society,
pp. 350–357,
doi:10.1109/SFCS.1981.32.
Danny Dolev & Andrew C. Yao (1983):
On the security of public key protocols.
IEEE Transactions on Information Theory 29(2),
pp. 198–207,
doi:10.1109/TIT.1983.1056650.
Fabio Fioravanti, Alberto Pettorossi & Maurizio Proietti (2002):
Verification of sets of infinite state processes using program transformation.
In: Alberto Pettorossi: Logic Based Program Synthesis and Transformation. Proceedings,
LNCS 2372.
Springer-Verlag,
pp. 111–128,
doi:10.1007/3-540-45607-4_7.
Robert W. Floyd (1967):
Nondeterministic algorithms.
Journal of the ACM 14(4),
pp. 636–644,
doi:10.1145/321420.321422.
Yoshihiko Futamura, Zenjiro Konishi & Robert Glück (2002):
Program transformation system based on generalized partial computation.
New Generation Computing 20(1),
pp. 75–99,
doi:10.1007/BF03037260.
Robert Glück (1994):
On the generation of specializers.
Journal of Functional Programming 4(4),
pp. 499–514,
doi:10.1017/S0956796800001167.
Robert Glück (2016):
A practical simulation result for two-way pushdown automata.
In: Yo-Sub Han & Kai Salomaa: Implementation and Application of Automata. Proceedings,
LNCS 9705.
Springer-Verlag,
pp. 113–124,
doi:10.1007/978-3-319-40946-7_10.
Robert Glück & Jesper Jørgensen (1994):
Generating transformers for deforestation and supercompilation.
In: Baudouin Le Charlier: Static Analysis. Proceedings,
LNCS 864.
Springer-Verlag,
pp. 432–448,
doi:10.1007/3-540-58485-4_57.
Robert Glück & Michael Leuschel (2000):
Abstraction-based partial deduction for solving inverse problems: a transformational approach to software verification.
In: Dines Bjørner, Manfred Broy & Alexandre V. Zamulin: Perspectives of System Informatics. Proceedings,
LNCS 1755.
Springer-Verlag,
pp. 93–100,
doi:10.1007/3-540-46562-6_8.
Neil D. Jones (1977):
A note on linear time simulation of deterministic two-way pushdown automata.
Information Processing Letters 6(4),
pp. 110–112,
doi:10.1016/0020-0190(77)90022-9.
Neil D. Jones (1997):
Computability and Complexity: From a Programming Language Perspective.
Foundations of Computing.
MIT Press,
Cambridge, Massachusetts.
Andrei V. Klimov (2012):
Solving coverability problem for monotonic counter systems by supercompilation.
In: Edmund M. Clarke, Irina Virbitskaite & Andrei Voronkov: Perspectives of Systems Informatics. Proceedings,
LNCS 7162.
Springer-Verlag,
pp. 193–209,
doi:10.1007/978-3-642-29709-0_18.
Donald E. Knuth, James H. Morris & Vaughan R. Pratt (1977):
Fast pattern matching in strings.
SIAM Journal on Computing 6(2),
pp. 323–350,
doi:10.1137/0206024.
Robert Kowalski (1979):
Algorithm = logic + control.
Communications of the ACM 22(7),
pp. 424–436,
doi:10.1145/359131.359136.
Alexei P. Lisitsa & Andrei P. Nemytykh (2007):
Verification as a parameterized testing (experiments with the SCP4 supercompiler).
Programming and Computer Software 33(1),
pp. 14–23,
doi:10.1134/S0361768807010033.
Torben Æ. Mogensen (1994):
WORM-2DPDAs: an extension to 2DPDAs that can be simulated in linear time.
Information Processing Letters 52(1),
pp. 15–22,
doi:10.1016/0020-0190(94)90134-1.
Antonina N. Nepeivoda (2016):
Ping-pong protocols as prefix grammars: modelling and verification via program transformation.
Journal of Logical and Algebraic Methods in Programming 85(5),
pp. 782–804,
doi:10.1016/j.jlamp.2016.06.001.
Ronald L. Rivest, Adi Shamir & Leonard M. Adleman (1978):
A method for obtaining digital signatures and public-key cryptosystems.
Communications of the ACM 21(2),
pp. 120–126,
doi:10.1145/359340.359342.
Morten H. Sørensen & Robert Glück (1999):
Introduction to supercompilation.
In: John Hatcliff, Torben Æ. Mogensen & Peter Thiemann: Partial Evaluation. Practice and Theory,
LNCS 1706.
Springer-Verlag,
pp. 246–270,
doi:10.1007/3-540-47018-2_10.
Terrance Swift & David S. Warren (2012):
XSB: extending Prolog with tabled logic programming.
Theory and Practice of Logic Programming 12(1-2),
pp. 157–187,
doi:10.1017/S1471068411000500.
Valentin F. Turchin (1986):
The concept of a supercompiler.
ACM TOPLAS 8(3),
pp. 292–325,
doi:10.1145/5956.5957.
Klaus Wagner & Gerd Wechsung (1986):
Computational Complexity.
D. Reidel Publishing Company,
Dordrecht, The Netherlands.