default search action
Alley Stoughton
Person information
- affiliation: Boston University, MA, USA
- affiliation (former): MIT Lincoln Laboratory, Lexington, MA, USA
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c19]Alley Stoughton, Carol Chen, Marco Gaboardi, Weihao Qu:
Formalizing Algorithmic Bounds in the Query Model in EasyCrypt. ITP 2022: 30:1-30:21 - 2020
- [c18]Alley Stoughton, Marco Vassena:
PLAS'20: 15th Workshop on Programming Languages and Analysis for Security. CCS 2020: 2151-2152 - [e1]Alley Stoughton, Marco Vassena:
PLAS'20: Proceedings of the 15th Workshop on Programming Languages and Analysis for Security, Virtual Event, USA, 13 November, 2020. ACM 2020, ISBN 978-1-4503-8092-8 [contents]
2010 – 2019
- 2019
- [c17]José Bacelar Almeida, Cécile Baritel-Ruet, Manuel Barbosa, Gilles Barthe, François Dupressoir, Benjamin Grégoire, Vincent Laporte, Tiago Oliveira, Alley Stoughton, Pierre-Yves Strub:
Machine-Checked Proofs for Cryptographic Standards: Indifferentiability of Sponge and Secure High-Assurance Implementations of SHA-3. CCS 2019: 1607-1622 - [c16]Ran Canetti, Alley Stoughton, Mayank Varia:
EasyUC: Using EasyCrypt to Mechanize Proofs of Universally Composable Security. CSF 2019: 167-183 - [i3]Ran Canetti, Alley Stoughton, Mayank Varia:
EasyUC: Using EasyCrypt to Mechanize Proofs of Universally Composable Security. IACR Cryptol. ePrint Arch. 2019: 582 (2019) - [i2]José Bacelar Almeida, Cécile Baritel-Ruet, Manuel Barbosa, Gilles Barthe, François Dupressoir, Benjamin Grégoire, Vincent Laporte, Tiago Oliveira, Alley Stoughton, Pierre-Yves Strub:
Machine-Checked Proofs for Cryptographic Standards. IACR Cryptol. ePrint Arch. 2019: 1155 (2019) - 2017
- [c15]Alley Stoughton, Mayank Varia:
Mechanizing the Proof of Adaptive, Information-Theoretic Security of Cryptographic Protocols in the Random Oracle Model. CSF 2017: 83-99 - 2016
- [j4]Jeffrey Hughes, Cassandra Sparks, Alley Stoughton, Rinku Parikh, Albert Reuther, Suresh Jagannathan:
Building Resource Adaptive Software Systems (BRASS): Objectives and System Evaluation. ACM SIGSOFT Softw. Eng. Notes 41(1): 1-2 (2016) - 2015
- [i1]Jeffrey Hughes, Cassandra Sparks, Alley Stoughton, Rinku Parikh, Albert Reuther, Suresh Jagannathan:
Building Resource Adaptive Software Systems (BRASS): Objectives and System Evaluation. CoRR abs/1510.02104 (2015) - 2014
- [c14]Alley Stoughton, Andrew Johnson, Samuel Beller, Karishma Chadha, Dennis Chen, Kenneth Foner, Michael Zhivich:
You Sank My Battleship!: A Case Study in Secure Programming. PLAS@ECOOP 2014: 2
2000 – 2009
- 2008
- [c13]Alley Stoughton:
A functional model-view-controller software architecture for command-oriented programs. ICFP-WGP 2008: 1-12 - [c12]Alley Stoughton:
Experimenting with formal languages using forlan. FDPE@ICFP 2008: 41-50 - 2002
- [c11]Christian Haack, Brian Howard, Allen Stoughton, Joe B. Wells:
Fully Automatic Adaptation of Software Components Based on Semantic Specifications. AMAST 2002: 83-98 - 2001
- [c10]Allen Stoughton:
Infinite Pretty-printing in eXene. Scottish Functional Programming Workshop 2001: 13-24
1990 – 1999
- 1997
- [c9]Allen Stoughton:
An Operational Semantics Framework Supporting the Incremental Construction of Derivation Trees. HOOTS 1997: 122-133 - 1993
- [c8]Allen Stoughton:
Mechanizing Logical Relations. MFPS 1993: 359-377 - [c7]Achim Jung, Allen Stoughton:
Studying the Fully Abstract Model of PCF within its Continuous Function Model. TLCA 1993: 230-244 - 1991
- [j3]Allen Stoughton:
Interdefinability of Parallel Operations in PCF. Theor. Comput. Sci. 79(2): 357-358 (1991) - [c6]Allen Stoughton:
Parallel PCF Has a Unique Extensional Model. LICS 1991: 146-151
1980 – 1989
- 1989
- [c5]Allen Stoughton:
Equationally Fully Abstract Models of PCF. Mathematical Foundations of Programming Semantics 1989: 271-283 - 1988
- [b2]Allen Stoughton:
Fully abstract models of programming languages. Research Notes in Theoretical Computer Science, Pitman 1988, ISBN 978-0-273-08788-5, pp. 1-154 - [j2]Allen Stoughton:
Substitution Revisited. Theor. Comput. Sci. 59: 317-325 (1988) - 1986
- [b1]Allen Stoughton:
Fully abstract models of programming languages. University of Edinburgh, UK, 1986 - 1983
- [j1]Douglas Stott Parker Jr., Gerald J. Popek, Gerard Rudisin, Allen Stoughton, Bruce J. Walker, Evelyn Walton, Johanna M. Chow, David A. Edwards, Stephen Kiser, Charles S. Kline:
Detection of Mutual Inconsistency in Distributed Systems. IEEE Trans. Software Eng. 9(3): 240-247 (1983) - 1982
- [c4]Vittal Kini, David F. Martin, Allen Stoughton:
Testing the INRIA Ada formal definition: the USC-ISI formal semantics project. AdaTEC Conference on Ada 1982: 120-128 - 1981
- [c3]Douglas Stott Parker Jr., Gerald J. Popek, Gerard Rudisin, Allen Stoughton, Bruce J. Walker, Evelyn Walton, Johanna M. Chow, David A. Edwards, Stephen Kiser, Charles S. Kline:
Detection of Mutual Inconsitency in Distributed Systems. Berkeley Workshop 1981: 172-184 - [c2]Allen Stoughton:
Access Flow: A Protection Model which Integrates Access Control and Information Flow. S&P 1981: 9-18
1970 – 1979
- 1979
- [c1]Gerald J. Popek, Mark Kampe, Charles S. Kline, Allen Stoughton, Michael Urban, Evelyn Walton:
UCLA Secure Unix. MARK 1979: 355-364
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-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint