Bibliography

Monographs

1
Torben Amtoft, Flemming Nielson, and Hanne Riis Nielson.
Type and Effect Systems: Behaviours for Concurrency.
Imperial College Press, 1999.

Journal articles

2
Torben Amtoft and Anindya Banerjee.
A theory of slicing for imperative probabilistic programs.
ACM TOPLAS, 42(2), April 2020.
A substantially extended version of [12].

3
Torben Amtoft, Kelly Androutsopoulos, David Clark, Mark Harman, and Zheng Li.
An alternative characterization of weak order dependence.
Information Processing Letters, 110:939–943, October 2010.

4
Torben Amtoft.
Flow-sensitive type systems and the ambient calculus.
Higher-Order and Symbolic Computation, 21(4):411–442, December 2008.

5
Torben Amtoft.
Slicing for modern program structures: a theory for eliminating irrelevant loops.
Information Processing Letters, 106(2):45–51, April 2008.

6
Venkatesh Prasad Ranganath, Torben Amtoft, Anindya Banerjee, John Hatcliff, and Matthew B. Dwyer.
A new foundation for control dependence and slicing for modern program structures.
ACM TOPLAS, 29(5), 2007.
A special issue with extended versions of selected papers from the 14th European Symposium on Programming (ESOP 2005).

7
Torben Amtoft and Anindya Banerjee.
A logic for information flow analysis with an application to forward slicing of simple imperative programs.
Science of Computer Programming, 64(1):3–28, 2007.

8
Torben Amtoft, Assaf J. Kfoury, and Santiago M. Pericas-Geertsen.
Orderly communication in the ambient calculus.
Computer Languages, Systems & Structures, 28:29–60, 2002 (Elsevier Science).

9
Torben Amtoft, Hanne Riis Nielson, and Flemming Nielson.
Behaviour analysis for validating communication patterns.
Software Tools for Technology Transfer, 2(1):13–28, 1998.

10
Torben Amtoft, Flemming Nielson, and Hanne Riis Nielson.
Type and behaviour reconstruction for higher-order concurrent programs.
Journal of Functional Programming, 7(3):321–347, May 1997.

11
Torben Amtoft and Jesper Larsson Träff.
Partial memoization for obtaining linear time behavior of a 2DPDA.
Theoretical Computer Science, 98(2):347–356, May 1992.

Conference articles

12
Torben Amtoft and Anindya Banerjee.
A theory of slicing for probabilistic control flow graphs.
In Proc. FoSSaCS 2016 (part of ETAPS'16), pages 180–196, Springer LNCS 9634, 2016. Acceptance rate: 36.5 %
A preliminary version, with full proofs, appears as Technical Report 2015-1, CIS Department, Kansas State University, July 2015.

13
Torben Amtoft, Josiah Dodds, Zhi Zhang, Andrew Appel, Lennart Beringer, John Hatcliff, Xinming Ou, and Andrew Cousino.
A certificate infrastructure for machine-checked proofs of conditional information flow.
In First Conference on Principles of Security and Trust (part of ETAPS 2012), pages 369–389, Springer LNCS 7215, 2012. Acceptance rate: 30 %.

14
Torben Amtoft, John Hatcliff and Edwin Rodríguez.
Precise and automated contract-based reasoning for verification and certification of information flow properties of programs with arrays.
In Proc. ESOP 2010 (part of ETAPS 2010), pages 43–63, Springer LNCS 6012, 2010. Acceptance rate: 24.8 %.

15
Ye Zhang, Torben Amtoft, and Flemming Nielson.
From generic to specific: off-line optimization for a general constraint solver.
In Proceedings of 7th International Conference on Generative Programming and Component Engineering (GPCE'08), pages 45–53, ACM Press, October 2008. Acceptance rate: 31 %.

16
Torben Amtoft, John Hatcliff, Edwin Rodríguez, Robby, Jonathan Hoag, and David Greve.
Specification and checking of software contracts for conditional information flow.
In Proceedings of the 15th International Symposium on Formal Methods (FM'08), pages 229–245, Springer LNCS 5014, May 2008. Acceptance rate: 21.7 %.
An extended version appears as Technical Report SAnToS-TR2007-5, CIS Department, Kansas State University.
An extended version appears as Chapter 12 in Design and Verification of Microprocessor Systems for High-Assurance Applications, edited by David S. Hardin.

17
Torben Amtoft and Anindya Banerjee.
Verification condition generation for conditional information flow.
In Proceedings of the 5th ACM Workshop on Formal Methods in Security Engineering (FMSE'07), pages 2–11, George Mason University, November 2007. Acceptance rate: 28.6 %.
An extended version appears as Technical Report 2007-2, Dept. of Computing and Information Sciences, Kansas State University, August 2007.

18
Torben Amtoft, Sruthi Bandhakavi, and Anindya Banerjee.
A logic for information flow in object-oriented programs.
In Proceedings of the 33rd Annual ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages (POPL'06), pages 91–102, ACM Press, 2006. Acceptance rate: 19.8 %.

19
Venkatesh Ranganath, Torben Amtoft, Anindya Banerjee, Matthew B. Dwyer, and John Hatcliff.
A new foundation for control-dependence and slicing for modern program structures.
In Proc. ESOP 2005 (part of ETAPS 2005), pages 77–93, Springer LNCS 3444, 2005. Acceptance rate: 24.6 %.

20
Torben Amtoft and Anindya Banerjee.
Information flow analysis in logical form.
In Proc. SAS 2004, pages 100–115, Springer LNCS 3148, 2004.
Received the SAS'04 Best Paper Award.
Acceptance rate: 36.5 %.
An extended version appears as the technical report 2004-3, Department of Computing and Information Sciences, Kansas State University, April 2004.

21
Torben Amtoft and Henning Makholm and J. B. Wells.
PolyA: true type polymorphism for mobile ambients.
In Proc. TCS 2004, pages 591–604, Kluwer, 2004.
An extended version appears as the technical report HW-MACS-TR-0015, School of Mathematical and Computer Sciences, Heriot-Watt University, February 2004.

22
Torben Amtoft and Robert Muller.
Inferring annotated types for inter-procedural register allocation with constructor flattening.
Proceedings of ACM SIGPLAN TLDI'03 Workshop, pages 86–97, ACM Press, January 2003. Acceptance rate: 42 %.

23
Torben Amtoft, Assaf J. Kfoury, and Santiago M. Pericas-Geertsen.
What are polymorphically-typed ambients?
In Proc. ESOP 2001 (part of ETAPS 2001), pages 206–220, Springer LNCS 2028, 2001. Acceptance rate: 34 %.
An extended version appears as the technical report BUCS-TR-2000-021, Boston University.

24
Torben Amtoft and Franklyn Turbak.
Faithful translations between polyvariant flows and polymorphic types.
In Proc. ESOP 2000 (part of ETAPS 2000), pages 26–40, Springer LNCS 1782, 2000. Acceptance rate: 31 %.

25
Hanne Riis Nielson, Torben Amtoft, and Flemming Nielson.
Behaviour analysis and safety conditions: a case study in CML.
In Proc. FASE'98 (part of ETAPS'98), pages 255–269, Springer LNCS 1382, 1998. Acceptance rate: 31 %.

26
Torben Amtoft.
Local type reconstruction by means of symbolic fixed point iteration.
In Proc. ESOP'94, pages 43–57, Springer LNCS 788, 1994. Acceptance rate: 28 %.

27
Torben Amtoft.
Minimal thunkification.
In Proc. WSA'93, pages 218–229, Springer LNCS 724, 1993. Acceptance rate: 29 %.

28
Torben Amtoft.
Unfold/fold transformations preserving termination properties.
In Proc. PLILP'92, pages 187–201, Springer LNCS 631, August 1992. Acceptance rate: 35 %.

29
Torben Amtoft.
Properties of unfolding-based meta-level systems.
In Partial Evaluation and Semantics-Based Program Manipulation (PEPM'91), New Haven, Connecticut. Sigplan Notices, vol. 26, no. 9, pages 243–254, 1991. Acceptance rate: 41 %.

30
Torben Amtoft, Thomas Nikolajsen, Jesper Larsson Träff, and Neil D. Jones.
Experiments with implementations of two theoretical constructions.
In Logic at Botik, USSR, pages 119–133, Springer LNCS 363, July 1989.

Other reviewed articles

31
Torben Amtoft and Kelly Androutsopoulos and David Clark.
Correctly slicing extended finite state machines.
In From Lambda Calculus to Cybersecurity Through Program Analysis: Essays Dedicated to Chris Hankin on the Occasion of His Retirement, Alessandra Di Pierro and Pasquale Malacaria and Rajagopal Nagarajan (editors), pages 149–197, Springer LNCS 12065, 2020.
A much preliminary version appears as Research Note RN/13/22 from University College London, Department of Computer Science, December 2013.

32
Torben Amtoft, Charles Consel, Olivier Danvy, and Karoline Malmkjær.
The abstraction and instantiation of string-matching programs.
In The Essence of Computation: Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones, Torben Mogensen and David Schmidt and I. Hal Sudborough (editors), pages 332–357, Springer LNCS 2566, 2002.
An extended version appeared as Technical Report BRICS RS-01-12, DAIMI, Aarhus, Denmark, April 2001.

33
Hanne Riis Nielson, Flemming Nielson, and Torben Amtoft.
Polymorphic subtyping for effect analysis: the static semantics.
In Analysis and Verification of Multiple-Agent Languages, pages 141–171, Springer LNCS 1192, 1997. Acceptance rate: 87 %.

34
Torben Amtoft, Flemming Nielson, Hanne Riis Nielson, and Jürgen Ammann.
Polymorphic subtyping for effect analysis: the dynamic semantics.
In Analysis and Verification of Multiple-Agent Languages, pages 172–206, Springer LNCS 1192, 1997. Acceptance rate: 87 %.

35
Flemming Nielson, Hanne Riis Nielson, and Torben Amtoft.
Polymorphic subtyping for effect analysis: the algorithm.
In Analysis and Verification of Multiple-Agent Languages, pages 207–243, Springer LNCS 1192, 1997. Acceptance rate: 87 %.

Miscellaneous

36
Torben Amtoft and J.B. Wells.
Mobile processes with dependent communication types and singleton types for names and capabilities.
Technical report 2002-3, Department of Computing and Information Sciences, Kansas State University, December 2002.

37
Ian Westmacott, J. B. Wells, Robert Muller, and Torben Amtoft.
A mechanical verification of region inference: using an automatic theorem prover to verify a type-based program transformation.
Submitted for publication, 2002.

38
Torben Amtoft.
Causal type system for ambient movements.
Submitted for publication, October 2001.
Technical report 2002-04, Department of Computing and Information Sciences, Kansas State University, 2002.

39
Torben Amtoft.
Partial evaluation for constraint-based program analyses.
BRICS Technical Report BRICS-RS-99-45, DAIMI, University of Aarhus, Denmark, 1999.

40
Torben Amtoft.
Strictness types: An inference algorithm and an application.
Technical Report PB-448, DAIMI, University of Aarhus, Denmark, August 1993.

41
Torben Amtoft.
Sharing of Computations.
PhD thesis, DAIMI, University of Aarhus, Denmark, 1993.
Technical report PB-453.

42
Torben Amtoft and Jesper Larsson Träff.
Memoization and its use in lazy and incremental program generation.
Master's thesis, DIKU, University of Copenhagen, Denmark, August 1989.
No. 89-8-1.