Zobrazeno 1 - 10
of 53
pro vyhledávání: '"Torben Amtoft"'
Autor:
Torben Amtoft, Anindya Banerjee
Publikováno v:
ACM Transactions on Programming Languages and Systems. 42:1-71
Dedicated to the memory of Sebastian Danicic. We present a theory for slicing imperative probabilistic programs containing random assignments and “observe” statements for conditioning. We represent such programs as probabilistic control-flow grap
Publikováno v:
From Lambda Calculus to Cybersecurity Through Program Analysis ISBN: 9783030411022
From Lambda Calculus to Cybersecurity Through Program Analysis
From Lambda Calculus to Cybersecurity Through Program Analysis
We consider slicing extended finite state machines. Extended finite state machines (EFSMs) combine a finite state machine with a store and can model a range of computational phenomena, from high-level software to cyber-physical systems. EFSMs are ess
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d83bbd72b61e6093335c4a0c496017e
https://doi.org/10.1007/978-3-030-41103-9_6
https://doi.org/10.1007/978-3-030-41103-9_6
Autor:
Anindya Banerjee, Torben Amtoft
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783662496299
FoSSaCS
FoSSaCS
We present a theory for slicing probabilistic imperative programs—containing random assignment and “observe” statements—represented as control flow graphs whose nodes transform probability distributions. We show that such a representation all
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5923e58482250344d0f3d79788c66e6d
https://doi.org/10.1007/978-3-662-49630-5_11
https://doi.org/10.1007/978-3-662-49630-5_11
Publikováno v:
Information Processing Letters. 110:939-943
Control dependence forms the basis for many program analyses, such as program slicing. Recent work on control dependence analysis has led to new definitions of dependence that can allow for reactive programs with their necessarily non-terminating com
Autor:
Torben Amtoft
Publikováno v:
Higher-Order and Symbolic Computation. 21:411-442
The Ambient Calculus was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code. Numerous analyses have been developed for numerous variants of that calculus. We take up the challenge of developing, in a t
Autor:
Torben Amtoft
Publikováno v:
Information Processing Letters. 106:45-51
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, the slice program should have the same termination properties as the or
Publikováno v:
Computer Languages, Systems & Structures. 28:29-60
The Ambient Calculus (henceforth, AC) was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code (In: Nivat M, editor. FoSSaCS '98, Lecture Notes in Computer Science, vol. 1378. Berlin: Springer, 1998. p.
Autor:
Troels Kolding, Ragnar Vidir Reynisson, Søren Laursen, Ole Kiel Jensen, Torben Amtoft, Torben Larsen, Per Madsen, Michael Bohl Jenner, Jan H. Mikkelsen
Publikováno v:
Wireless Personal Communications. 23:55-66
Unified RF requirements are derived for an UMTS Terrestrial Radio Access/Frequency Division Duplex (UTRA/FDD) compliant mobile transceiver. A set of transceiver requirements are proposed with consideration to system issues including duplex aspects. F
Publikováno v:
International Journal on Software Tools for Technology Transfer (STTT). 2:13-28
these can be viewed as a kind of causal constraints or as a kind of process algebra terms. We present a system that infers behaviors from a useful fragment of Concurrent ML programs; it is based on previously developed theoretical results and forms t
Autor:
Torben Amtoft, Josiah Dodds, Lennart Beringer, Andrew Cousino, John Hatcliff, Xinming Ou, Zhi Zhang, Andrew W. Appel
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642286407
POST
POST
In previous work, we have proposed a compositional framework for stating and automatically verifying complex conditional information flow policies using a relational Hoare logic. The framework allows developers and verifiers to work directly with the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::971434ccabffd78b2b1b9e3d1dde1176
https://doi.org/10.1007/978-3-642-28641-4_20
https://doi.org/10.1007/978-3-642-28641-4_20