Torben Amtoft - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2020

A Theory of Slicing for Imperative Probabilistic ProgramsTorben Amtoft, Anindya Banerjee 0001. TOPLAS, 42(2), 2020. [doi]

Correctly Slicing Extended Finite State MachinesTorben Amtoft, Kelly Androutsopoulos, David Clark. BIRTHDAY 2020: 149-197 [doi]

2016

A Theory of Slicing for Probabilistic Control Flow GraphsTorben Amtoft, Anindya Banerjee. fossacs 2016: 180-196 [doi]

2012

A Certificate Infrastructure for Machine-Checked Proofs of Conditional Information FlowTorben Amtoft, Josiah Dodds, Zhi Zhang, Andrew W. Appel, Lennart Beringer, John Hatcliff, Xinming Ou, Andrew Cousino. post 2012: 369-389 [doi]

2010

2008

2007

Verification condition generation for conditional information flowTorben Amtoft, Anindya Banerjee. ccs 2007: 2-11 [doi]

A logic for information flow analysis with an application to forward slicing of simple imperative programsTorben Amtoft, Anindya Banerjee. SCP, 64(1):3-28, 2007. [doi]

A new foundation for control dependence and slicing for modern program structuresVenkatesh Prasad Ranganath, Torben Amtoft, Anindya Banerjee, John Hatcliff, Matthew B. Dwyer. TOPLAS, 29(5):27, 2007. [doi]

2006

A logic for information flow in object-oriented programsTorben Amtoft, Sruthi Bandhakavi, Anindya Banerjee. POPL 2006: 91-102 [doi]

2005

A New Foundation for Control-Dependence and Slicing for Modern Program StructuresVenkatesh Prasad Ranganath, Torben Amtoft, Anindya Banerjee, Matthew B. Dwyer, John Hatcliff. ESOP 2005: 77-93 [doi]

2004

PolyA: True Type Polymorphism for Mobile AmbientsTorben Amtoft, Henning Makholm, J. B. Wells. ifipTCS 2004: 591604

Information Flow Analysis in Logical FormTorben Amtoft, Anindya Banerjee. SAS 2004: 100-115 [doi]

2003

Inferring annotated types for inter-procedural register allocation with constructor flatteningTorben Amtoft, Robert Muller. tldi 2003: 86-97 [doi]

2002

2001

What Are Polymorphically-Typed Ambients?Torben Amtoft, A. J. Kfoury, Santiago M. Pericás-Geertsen. ESOP 2001: 206-220 [doi]

2000

Faithful Translations between Polyvariant Flows and Polymorphic TypesTorben Amtoft, Franklyn A. Turbak. ESOP 2000: 26-40 [doi]

1999

Type and effect systems - behaviours for concurrencyTorben Amtoft, Hanne Riis Nielson, Flemming Nielson. Imperial College Press, 1999.

1998

Behavior Analysis for Validating Communication PatternsTorben Amtoft, Hanne Riis Nielson, Flemming Nielson. STTT, 2(1):13-28, 1998. [doi]

Behaviour Analysis and Safety Conditions: A Case Study in CMLHanne Riis Nielson, Torben Amtoft, Flemming Nielson. FASE 1998: 255-269 [doi]

1997

Type and Behaviour Reconstruction for Higher-Order Concurrent ProgramsTorben Amtoft, Flemming Nielson, Hanne Riis Nielson. JFP, 7(3):321-347, 1997.

1996

Polymorphic Subtyping for Effect Analysis: The Dynamic SemanticsTorben Amtoft, Flemming Nielson, Hanne Riis Nielson, Jürgen Ammann. lomaps 1997: 172-206

Polymorphic Subtyping for Effect Analysis: The AlgorithmFlemming Nielson, Hanne Riis Nielson, Torben Amtoft. lomaps 1997: 207-243

Polymorphic Subtyping for Effect Analysis: The Static SemanticsHanne Riis Nielson, Flemming Nielson, Torben Amtoft. lomaps 1997: 141-171

1994

Local Type Reconstruction by Means of Symbolic Fixed Point IterationTorben Amtoft. ESOP 1994: 43-57

1993

Minimal ThunkificationTorben Amtoft. SAS 1993: 218-229

1992

Unfold/fold Transformations Preserving Termination PropertiesTorben Amtoft. plilp 1992: 187-201

Partial Memoization for Obtaining Linear Time Behavior of a 2DPDATorben Amtoft, Jesper Larsson Träff. TCS, 98(2):347-356, 1992.

Sign in or sign up to see more results.

runs on WebDSL