default search action
Torben Amtoft
Person information
- affiliation: Kansas State University, Manhattan, KS, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j11]Torben Amtoft, Anindya Banerjee
:
A Theory of Slicing for Imperative Probabilistic Programs. ACM Trans. Program. Lang. Syst. 42(2): 6:1-6:71 (2020) - [c24]Torben Amtoft, Kelly Androutsopoulos, David Clark
Correctly Slicing Extended Finite State Machines. From Lambda Calculus to Cybersecurity Through Program Analysis 2020: 149-197
2010 – 2019
- 2017
- [i2]Torben Amtoft, Anindya Banerjee:
A Theory of Slicing for Probabilistic Control-Flow Graphs. CoRR abs/1711.02246 (2017) - [i1]Torben Amtoft, Anindya Banerjee:
A Semantics for Probabilistic Control-Flow Graphs. CoRR abs/1711.02256 (2017) - 2016
- [c23]Torben Amtoft, Anindya Banerjee:
A Theory of Slicing for Probabilistic Control Flow Graphs. FoSSaCS 2016: 180-196 - 2012
- [c22]Torben Amtoft, Josiah Dodds, Zhi Zhang, Andrew W. Appel
A Certificate Infrastructure for Machine-Checked Proofs of Conditional Information Flow. POST 2012: 369-389 - 2010
- [j10]Torben Amtoft, Kelly Androutsopoulos, David Clark
An alternative characterization of weak order dependence. Inf. Process. Lett. 110(21): 939-943 (2010) - [c21]Torben Amtoft, John Hatcliff, Edwin Rodríguez:
Precise and Automated Contract-Based Reasoning for Verification and Certification of Information Flow Properties of Programs with Arrays. ESOP 2010: 43-63 - [p1]Torben Amtoft, John Hatcliff, Edwin Rodríguez, Robby, Jonathan Hoag, David A. Greve:
Specification and Checking of Software Contracts for Conditional Information Flow. Design and Verification of Microprocessor Systems for High-Assurance Applications 2010: 341-379
2000 – 2009
- 2008
- [j9]Torben Amtoft:
Slicing for modern program structures: a theory for eliminating irrelevant loops. Inf. Process. Lett. 106(2): 45-51 (2008) - [j8]Torben Amtoft:
Flow-sensitive type systems and the ambient calculus. High. Order Symb. Comput. 21(4): 411-442 (2008) - [c20]Torben Amtoft, John Hatcliff, Edwin Rodríguez, Robby, Jonathan Hoag, David A. Greve:
Specification and Checking of Software Contracts for Conditional Information Flow. FM 2008: 229-245 - [c19]Ye Zhang, Torben Amtoft, Flemming Nielson:
From generic to specific: off-line optimization for a general constraint solver. GPCE 2008: 45-54 - 2007
- [j7]Torben Amtoft, Anindya Banerjee:
A logic for information flow analysis with an application to forward slicing of simple imperative programs. Sci. Comput. Program. 64(1): 3-28 (2007) - [j6]Venkatesh Prasad Ranganath
A new foundation for control dependence and slicing for modern program structures. ACM Trans. Program. Lang. Syst. 29(5): 27 (2007) - [c18]Torben Amtoft, Anindya Banerjee:
Verification condition generation for conditional information flow. FMSE 2007: 2-11 - 2006
- [c17]Torben Amtoft, Sruthi Bandhakavi, Anindya Banerjee:
A logic for information flow in object-oriented programs. POPL 2006: 91-102 - 2005
- [c16]Venkatesh Prasad Ranganath
A New Foundation for Control-Dependence and Slicing for Modern Program Structures. ESOP 2005: 77-93 - 2004
- [c15]Torben Amtoft, Henning Makholm, J. B. Wells:
PolyA: True Type Polymorphism for Mobile Ambients. IFIP TCS 2004: 591-604 - [c14]Torben Amtoft, Anindya Banerjee:
Information Flow Analysis in Logical Form. SAS 2004: 100-115 - 2003
- [c13]Torben Amtoft, Robert Muller:
Inferring annotated types for inter-procedural register allocation with constructor flattening. TLDI 2003: 86-97 - 2002
- [j5]Torben Amtoft, A. J. Kfoury, Santiago M. Pericás-Geertsen:
Orderly communication in the Ambient Calculus. Comput. Lang. Syst. Struct. 28(1): 29-60 (2002) - [j4]Per Madsen, Ole K. Jensen
UTRA/FDD RF Transceiver Requirements. Wirel. Pers. Commun. 23(1): 55-66 (2002) - [c12]Torben Amtoft, Charles Consel, Olivier Danvy
The Abstraction and Instantiation of String-Matching Programs. The Essence of Computation 2002: 332-357 - 2001
- [c11]Torben Amtoft, A. J. Kfoury, Santiago M. Pericás-Geertsen:
What Are Polymorphically-Typed Ambients? ESOP 2001: 206-220 - 2000
- [c10]Torben Amtoft, Franklyn A. Turbak:
Faithful Translations between Polyvariant Flows and Polymorphic Types. ESOP 2000: 26-40
1990 – 1999
- 1999
- [b1]Torben Amtoft, Hanne Riis Nielson, Flemming Nielson:
Type and effect systems - behaviours for concurrency. Imperial College Press 1999, ISBN 978-1-86094-154-2, pp. 1-253 - 1998
- [j3]Torben Amtoft, Hanne Riis Nielson, Flemming Nielson:
Behavior Analysis for Validating Communication Patterns. Int. J. Softw. Tools Technol. Transf. 2(1): 13-28 (1998) - [c9]Hanne Riis Nielson, Torben Amtoft, Flemming Nielson:
Behaviour Analysis and Safety Conditions: A Case Study in CML. FASE 1998: 255-269 - 1997
- [j2]Torben Amtoft, Flemming Nielson, Hanne Riis Nielson:
Type and Behaviour Reconstruction for Higher-Order Concurrent Programs. J. Funct. Program. 7(3): 321-347 (1997) - 1996
- [c8]Hanne Riis Nielson, Flemming Nielson, Torben Amtoft:
Polymorphic Subtyping for Effect Analysis: The Static Semantics. LOMAPS 1996: 141-171 - [c7]Torben Amtoft, Flemming Nielson, Hanne Riis Nielson, Jürgen Ammann:
Polymorphic Subtyping for Effect Analysis: The Dynamic Semantics. LOMAPS 1996: 172-206 - [c6]Flemming Nielson, Hanne Riis Nielson, Torben Amtoft:
Polymorphic Subtyping for Effect Analysis: The Algorithm. LOMAPS 1996: 207-243 - 1994
- [c5]Torben Amtoft:
Local Type Reconstruction by Means of Symbolic Fixed Point Iteration. ESOP 1994: 43-57 - 1993
- [c4]Torben Amtoft:
Minimal Thunkification. WSA 1993: 218-229 - 1992
- [j1]Torben Amtoft, Jesper Larsson Träff:
Partial Memoization for Obtaining Linear Time Behavior of a 2DPDA. Theor. Comput. Sci. 98(2): 347-356 (1992) - [c3]Torben Amtoft:
Unfold/fold Transformations Preserving Termination Properties. PLILP 1992: 187-201 - 1991
- [c2]Torben Amtoft Hansen:
Properties of Unfolding-based Meta-level Systems. PEPM 1991: 243-254
1980 – 1989
- 1989
- [c1]Torben Amtoft Hansen, Thomas Nikolajsen, Jesper Larsson Träff, Neil D. Jones:
Experiments with Implementations of Two Theoretical Constructions. Logic at Botik 1989: 119-133
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: