Experiments with Implementations of Two Theoretical Constructions. - Torben Amtoft Hansen; Thomas Nikolajsen; Jesper Larsson Träff; Neil D. Jones (Logic at Botik, 1989)

Properties of Unfolding-based Meta-level Systems. - Torben Amtoft Hansen (PEPM, 1991)

Unfold/fold Transformations Preserving Termination Properties. - Torben Amtoft (PLILP, 1992)

Partial Memoization for Obtaining Linear Time Behavior of a 2DPDA. - Torben Amtoft; Jesper Larsson Träff (Theor. Comput. Sci., 1992)

Minimal Thunkification. - Torben Amtoft (WSA, 1993)

Local Type Reconstruction by Means of Symbolic Fixed Point Iteration. - Torben Amtoft (ESOP, 1994)

Polymorphic Subtyping for Effect Analysis: The Dynamic Semantics. - Torben Amtoft; Flemming Nielson; Hanne Riis Nielson; Jürgen Ammann (LOMAPS, 1996)

Polymorphic Subtyping for Effect Analysis: The Static Semantics. - Hanne Riis Nielson; Flemming Nielson; Torben Amtoft (LOMAPS, 1996)

Polymorphic Subtyping for Effect Analysis: The Algorithm. - Flemming Nielson; Hanne Riis Nielson; Torben Amtoft (LOMAPS, 1996)

Type and Behaviour Reconstruction for Higher-Order Concurrent Programs. - Torben Amtoft; Flemming Nielson; Hanne Riis Nielson (J. Funct. Program., 1997)

Behaviour Analysis and Safety Conditions: A Case Study in CML. - Hanne Riis Nielson; Torben Amtoft; Flemming Nielson (FASE, 1998)

Behavior Analysis for Validating Communication Patterns. - Torben Amtoft; Hanne Riis Nielson; Flemming Nielson (Int. J. Softw. Tools Technol. Transf., 1998)

Type and effect systems - behaviours for concurrency. - Torben Amtoft; Hanne Riis Nielson; Flemming Nielson (Imperial College Press, 1999)

Faithful Translations between Polyvariant Flows and Polymorphic Types. - Torben Amtoft; Franklyn A. Turbak (ESOP, 2000)

What Are Polymorphically-Typed Ambients? - Torben Amtoft; A. J. Kfoury; Santiago M. Pericás-Geertsen (ESOP, 2001)

The Abstraction and Instantiation of String-Matching Programs. - Torben Amtoft; Charles Consel; Olivier Danvy; Karoline Malmkjær (The Essence of Computation, 2002)

Orderly communication in the Ambient Calculus. - Torben Amtoft; A. J. Kfoury; Santiago M. Pericás-Geertsen (Comput. Lang. Syst. Struct., 2002)

UTRA/FDD RF Transceiver Requirements. - Per Madsen; Ole K. Jensen; Torben Amtoft; Ragnar V. Reynisson; Jan H. Mikkelsen; Søren Laursen; Troels E. Kolding; Torben Larsen; Michael Bohl Jenner (Wirel. Pers. Commun., 2002)

Inferring annotated types for inter-procedural register allocation with constructor flattening. - Torben Amtoft; Robert Muller (TLDI, 2003)

PolyA: True Type Polymorphism for Mobile Ambients. - Torben Amtoft; Henning Makholm; J. B. Wells (IFIP TCS, 2004)

Information Flow Analysis in Logical Form. - Torben Amtoft; Anindya Banerjee 001 (SAS, 2004)

A logic for information flow in object-oriented programs. - Torben Amtoft; Sruthi Bandhakavi; Anindya Banerjee 001 (POPL, 2006)

Verification condition generation for conditional information flow. - Torben Amtoft; Anindya Banerjee 001 (FMSE, 2007)

A logic for information flow analysis with an application to forward slicing of simple imperative programs. - Torben Amtoft; Anindya Banerjee 001 (Sci. Comput. Program., 2007)

A new foundation for control dependence and slicing for modern program structures. - Venkatesh Prasad Ranganath; Torben Amtoft; Anindya Banerjee 001; John Hatcliff; Matthew B. Dwyer (ACM Trans. Program. Lang. Syst., 2007)

Specification and Checking of Software Contracts for Conditional Information Flow. - Torben Amtoft; John Hatcliff; Edwin Rodríguez; Robby; Jonathan Hoag; David A. Greve (FM, 2008)

From generic to specific: off-line optimization for a general constraint solver. - Ye Zhang 002; Torben Amtoft; Flemming Nielson (GPCE, 2008)

Slicing for modern program structures: a theory for eliminating irrelevant loops. - Torben Amtoft (Inf. Process. Lett., 2008)

Flow-sensitive type systems and the ambient calculus. - Torben Amtoft (High. Order Symb. Comput., 2008)

Specification and Checking of Software Contracts for Conditional Information Flow. - Torben Amtoft; John Hatcliff; Edwin Rodríguez; Robby; Jonathan Hoag; David A. Greve (Design and Verification of Microprocessor Systems for High-Assurance Applications, 2010)

Precise and Automated Contract-Based Reasoning for Verification and Certification of Information Flow Properties of Programs with Arrays. - Torben Amtoft; John Hatcliff; Edwin Rodríguez (ESOP, 2010)

An alternative characterization of weak order dependence. - Torben Amtoft; Kelly Androutsopoulos; David Clark 001; Mark Harman; Zheng Li 002 (Inf. Process. Lett., 2010)

A Certificate Infrastructure for Machine-Checked Proofs of Conditional Information Flow. - Torben Amtoft; Josiah Dodds; Zhi Zhang; Andrew W. Appel; Lennart Beringer; John Hatcliff; Xinming Ou; Andrew Cousino (POST, 2012)

A Theory of Slicing for Probabilistic Control Flow Graphs. - Torben Amtoft; Anindya Banerjee 001 (FoSSaCS, 2016)

A Semantics for Probabilistic Control-Flow Graphs. - Torben Amtoft; Anindya Banerjee 001 (CoRR, 2017)

Correctly Slicing Extended Finite State Machines. - Torben Amtoft; Kelly Androutsopoulos; David Clark 001 (From Lambda Calculus to Cybersecurity Through Program Analysis, 2020)

A Theory of Slicing for Imperative Probabilistic Programs. - Torben Amtoft; Anindya Banerjee 001 (ACM Trans. Program. Lang. Syst., 2020)

A Fixed Point Iteration Technique for Proving Correctness of Slicing for Probabilistic Programs. - Torben Amtoft; Anindya Banerjee 001 (CoRR, 2024)