Torben Amtoft

Affiliations:
  • Kansas State University, Manhattan, KS, USA


According to our database1, Torben Amtoft authored at least 37 papers between 1989 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
A Theory of Slicing for Imperative Probabilistic Programs.
ACM Trans. Program. Lang. Syst., 2020

Correctly Slicing Extended Finite State Machines.
Proceedings of the From Lambda Calculus to Cybersecurity Through Program Analysis, 2020

2017
A Semantics for Probabilistic Control-Flow Graphs.
CoRR, 2017

2016
A Theory of Slicing for Probabilistic Control Flow Graphs.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

2012
A Certificate Infrastructure for Machine-Checked Proofs of Conditional Information Flow.
Proceedings of the Principles of Security and Trust - First International Conference, 2012

2010
An alternative characterization of weak order dependence.
Inf. Process. Lett., 2010

Precise and Automated Contract-Based Reasoning for Verification and Certification of Information Flow Properties of Programs with Arrays.
Proceedings of the Programming Languages and Systems, 2010

Specification and Checking of Software Contracts for Conditional Information Flow.
Proceedings of the Design and Verification of Microprocessor Systems for High-Assurance Applications., 2010

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

Slicing for modern program structures: a theory for eliminating irrelevant loops.
Inf. Process. Lett., 2008

From generic to specific: off-line optimization for a general constraint solver.
Proceedings of the Generative Programming and Component Engineering, 2008

Specification and Checking of Software Contracts for Conditional Information Flow.
Proceedings of the FM 2008: Formal Methods, 2008

2007
A new foundation for control dependence and slicing for modern program structures.
ACM Trans. Program. Lang. Syst., 2007

A logic for information flow analysis with an application to forward slicing of simple imperative programs.
Sci. Comput. Program., 2007

Verification condition generation for conditional information flow.
Proceedings of the 2007 ACM workshop on Formal methods in security engineering, 2007

2006
A logic for information flow in object-oriented programs.
Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2006

2004
Information Flow Analysis in Logical Form.
Proceedings of the Static Analysis, 11th International Symposium, 2004

PolyA: True Type Polymorphism for Mobile Ambients.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003
Inferring annotated types for inter-procedural register allocation with constructor flattening.
Proceedings of TLDI'03: 2003 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, 2003

2002
UTRA/FDD RF Transceiver Requirements.
Wirel. Pers. Commun., 2002

Orderly communication in the Ambient Calculus.
Comput. Lang. Syst. Struct., 2002

The Abstraction and Instantiation of String-Matching Programs.
Proceedings of the Essence of Computation, Complexity, Analysis, 2002

2001
What Are Polymorphically-Typed Ambients?
Proceedings of the Programming Languages and Systems, 2001

2000
Faithful Translations between Polyvariant Flows and Polymorphic Types.
Proceedings of the Programming Languages and Systems, 2000

1999
Type and effect systems - behaviours for concurrency.
Imperial College Press, ISBN: 978-1-86094-154-2, 1999

1998
Behavior Analysis for Validating Communication Patterns.
Int. J. Softw. Tools Technol. Transf., 1998

Behaviour Analysis and Safety Conditions: A Case Study in CML.
Proceedings of the Fundamental Approaches to Software Engineering, 1998

1997
Type and Behaviour Reconstruction for Higher-Order Concurrent Programs.
J. Funct. Program., 1997

1996
Polymorphic Subtyping for Effect Analysis: The Algorithm.
Proceedings of the Analysis and Verification of Multiple-Agent Languages, 1996

Polymorphic Subtyping for Effect Analysis: The Static Semantics.
Proceedings of the Analysis and Verification of Multiple-Agent Languages, 1996

Polymorphic Subtyping for Effect Analysis: The Dynamic Semantics.
Proceedings of the Analysis and Verification of Multiple-Agent Languages, 1996

1994
Local Type Reconstruction by Means of Symbolic Fixed Point Iteration.
Proceedings of the Programming Languages and Systems, 1994

1993
Minimal Thunkification.
Proceedings of the Static Analysis, Third International Workshop, 1993

1992
Partial Memoization for Obtaining Linear Time Behavior of a 2DPDA.
Theor. Comput. Sci., 1992

Unfold/fold Transformations Preserving Termination Properties.
Proceedings of the Programming Language Implementation and Logic Programming, 1992

1991
Properties of Unfolding-based Meta-level Systems.
Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1991

1989
Experiments with Implementations of Two Theoretical Constructions.
Proceedings of the Logic at Botik '89, 1989


  Loading...