default search action
Scott F. Smith 0001
Person information
- affiliation: The Johns Hopkins University, Department of Computer Science, Baltimore, MD, USA
Other persons with the same name
- Scott F. Smith — disambiguation page
- Scott F. Smith 0002 — Boise State University, ID, USA
- Scott F. Smith 0003 — Purdue University, West Lafayette, IN, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i1]Kelvin Qian, Scott F. Smith, Brandon Stride, Shiwei Weng, Ke Wu:
Semantic-Type-Guided Bug Finding. CoRR abs/2409.13896 (2024) - 2020
- [j18]Zachary Palmer
, Theodore Park, Scott F. Smith, Shiwei Weng
Higher-order demand-driven symbolic evaluation. Proc. ACM Program. Lang. 4(ICFP): 102:1-102:28 (2020) - [c43]Leandro Facchinetti, Zachary Palmer, Scott F. Smith, Ke Wu, Ayaka Yorihiro:
A Set-Based Context Model for Program Analysis. APLAS 2020: 3-24
2010 – 2019
- 2019
- [j17]Leandro Facchinetti, Zachary Palmer
Higher-order Demand-driven Program Analysis. ACM Trans. Program. Lang. Syst. 41(3): 14:1-14:53 (2019) - 2017
- [c42]Kenneth Roe, Scott F. Smith:
Using the coq theorem prover to verify complex data structure invariants. MEMOCODE 2017: 118-121 - [c41]Leandro Facchinetti, Zachary Palmer, Scott F. Smith:
Relative Store Fragments for Singleton Abstraction. SAS 2017: 106-127 - 2016
- [j16]Leandro Facchinetti, Zachary Palmer, Scott F. Smith:
Higher-Order Demand-Driven Program Analysis (Artifact). Dagstuhl Artifacts Ser. 2(1): 09:1-09:2 (2016) - [c40]Zachary Palmer, Scott F. Smith:
Higher-Order Demand-Driven Program Analysis. ECOOP 2016: 19:1-19:25 - [c39]Kenneth Roe, Scott F. Smith:
CoqPIE: An IDE Aimed at Improving Proof Development Productivity - (Rough Diamond). ITP 2016: 491-499 - 2014
- [c38]Zachary Palmer, Pottayil Harisanker Menon, Alexander Rozenshteyn, Scott F. Smith:
Types for Flexible Objects. APLAS 2014: 99-119 - 2013
- [c37]Peter C. Chapin, Christian Skalka, Scott F. Smith, Michael Watson:
Scalaness/nesT: type specialized staged programming for sensor networks. GPCE 2013: 135-144 - 2011
- [j15]Yu David Liu, Christian Skalka, Scott F. Smith:
Type-specialized staged programming with process separation. High. Order Symb. Comput. 24(4): 341-385 (2011) - [c36]Zachary Palmer, Scott F. Smith:
Backstage Java: making a difference in metaprogramming. OOPSLA 2011: 939-958 - 2010
- [c35]Aditya Kulkarni, Yu David Liu, Scott F. Smith:
Task types for pervasive atomicity. OOPSLA 2010: 671-690
2000 – 2009
- 2009
- [c34]Yu David Liu, Christian Skalka, Scott F. Smith:
Type-specialized staged programming with process separation. WGP@ICFP 2009: 49-60 - 2008
- [j14]Paritosh Shroff, Scott F. Smith, Mark Thober:
Securing information flow via dynamic capture of dependencies. J. Comput. Secur. 16(5): 637-688 (2008) - [j13]Christian Skalka, Scott F. Smith, David Van Horn
Types and trace effects of higher order programs. J. Funct. Program. 18(2): 179-249 (2008) - [c33]Swaroop Sridhar, Jonathan S. Shapiro, Scott F. Smith:
Sound and Complete Type Inference for a Systems Programming Language. APLAS 2008: 290-306 - [c32]Yu David Liu, Xiaoqi Lu, Scott F. Smith:
Coqa: Concurrent Objects with Quantized Atomicity. CC 2008: 260-275 - 2007
- [c31]Paritosh Shroff, Christian Skalka, Scott F. Smith:
The Nuggetizer: Abstracting Away Higher-Orderness for Program Verification. APLAS 2007: 2-18 - [c30]Paritosh Shroff, Scott F. Smith, Mark Thober:
Dynamic Dependency Monitoring to Secure Information Flow. CSF 2007: 203-217 - [c29]Scott F. Smith, Mark Thober:
Improving usability of information flow security in java. PLAS 2007: 11-20 - 2006
- [c28]Yu David Liu, Scott F. Smith:
A formal framework for component deployment. OOPSLA 2006: 325-344 - [c27]Xiaoqi Lu, Scott F. Smith:
A microkernel virtual machine: : building security with clear interfaces. PLAS 2006: 47-56 - [c26]Scott F. Smith, Mark Thober:
Refactoring programs to secure information flows. PLAS 2006: 75-84 - 2005
- [j12]Christian Skalka, Scott F. Smith:
Static use-based object confinement. Int. J. Inf. Sec. 4(1-2): 87-104 (2005) - [j11]François Pottier, Christian Skalka, Scott F. Smith:
A systematic approach to static access control. ACM Trans. Program. Lang. Syst. 27(2): 344-382 (2005) - [c25]Yu David Liu, Scott F. Smith:
Interaction-based programming with classages. OOPSLA 2005: 191-209 - [c24]Christian Skalka, Scott F. Smith, David Van Horn
A Type and Effect System for Flexible Abstract Interpretation of Java: (Extended Abstract). AIOOL@VMCAI 2005: 111-124 - 2004
- [c23]Christian Skalka, Scott F. Smith:
History Effects and Verification. APLAS 2004: 107-128 - [c22]Yu David Liu, Scott F. Smith:
Modules with Interfaces for Dynamic Linking and Communication. ECOOP 2004: 414-439 - 2002
- [j10]Scott F. Smith, Carolyn L. Talcott:
Specification Diagrams for Actor Systems. High. Order Symb. Comput. 15(4): 301-348 (2002) - [c21]Ran Rinat, Scott F. Smith:
Modular Internet Programming with Cells. ECOOP 2002: 257-280 - [c20]Christian Skalka, Scott F. Smith:
Set Types and Applications. TIP@MPC 2002: 75-94 - 2001
- [c19]Tiejun Wang, Scott F. Smith:
Precise Constraint-Based Type Inference for Java. ECOOP 2001: 99-117 - [c18]François Pottier, Christian Skalka, Scott F. Smith:
A Systematic Approach to Static Access Control. ESOP 2001: 30-45 - 2000
- [c17]Scott F. Smith, Tiejun Wang:
Polyvariant Flow Analysis with Constrained Types. ESOP 2000: 382-396 - [c16]Christian Skalka, Scott F. Smith:
Static enforcement of security with types. ICFP 2000: 34-45 - [e1]Scott F. Smith, Carolyn L. Talcott:
Formal Methods for Open Object-Based Distributed Systems IV, IFIF TC6/WG6.1 Fourth International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS 2000), September 6-8, 2000, Stanford, California, USA. IFIP Conference Proceedings 177, Kluwer 2000, ISBN 0-7923-7923-3 [contents]
1990 – 1999
- 1999
- [c15]Scott F. Smith, Carolyn L. Talcott:
Modular Reasoning for Actor Specification Diagrams. FMOODS 1999 - [c14]Ran Rinat, Menachem Magidor, Scott F. Smith:
Correspondence Polymorphism for Object-Oriented Languages. OOPSLA 1999: 167-186 - 1997
- [j9]Gul Agha, Ian A. Mason, Scott F. Smith, Carolyn L. Talcott:
A Foundation for Actor Computation. J. Funct. Program. 7(1): 1-72 (1997) - 1996
- [j8]Ian A. Mason, Scott F. Smith, Carolyn L. Talcott:
From Operational Semantics to Domain Theory. Inf. Comput. 128(1): 26-47 (1996) - [j7]Jens Palsberg, Scott F. Smith:
Constrained Types and Their Expressiveness. ACM Trans. Program. Lang. Syst. 18(5): 519-527 (1996) - [c13]Valery Trifonov, Scott F. Smith:
Subtyping Constrained Types. SAS 1996: 349-365 - 1995
- [j6]Scott F. Smith, Amy E. Zwarico:
Correct Compilation of Specifications to Deterministic Asynchronous Circuits. Formal Methods Syst. Des. 7(3): 155-226 (1995) - [j5]Furio Honsell, Ian A. Mason, Scott F. Smith, Carolyn L. Talcott:
A Variable Typed Logic of Effects. Inf. Comput. 119(1): 55-90 (1995) - [j4]Scott F. Smith:
Hybrid Partial-Total Type Theory. Int. J. Found. Comput. Sci. 6(3): 235-263 (1995) - [j3]Jonathan Eifrig, Scott F. Smith, Valery Trifonov, Amy E. Zwarico:
An Interpretation of Typed OOP in a Language with State. LISP Symb. Comput. 8(4): 357-397 (1995) - [j2]Kim B. Bruce, Luca Cardelli, Giuseppe Castagna, Jonathan Eifrig, Scott F. Smith, Valery Trifonov, Gary T. Leavens, Benjamin C. Pierce:
On Binary Methods. Theory Pract. Object Syst. 1(3): 221-242 (1995) - [c12]Jonathan Eifrig, Scott F. Smith, Valery Trifonov:
Sound Polymorphic Type Inference for Objects. OOPSLA 1995: 169-184 - [c11]Jonathan Eifrig, Scott F. Smith, Valery Trifonov:
Type inference for recursively constrained types and its application to OOP. MFPS 1995: 132-153 - 1994
- [c10]Jonathan Eifrig, Scott F. Smith, Valery Trifonov, Amy E. Zwarico:
Application of OOP Type Theory: State, Decidability, Integragtion. OOPSLA 1994: 16-30 - 1993
- [j1]Robert L. Constable, Scott F. Smith:
Computational Foundations of Basic Recursive Function Theory. Theor. Comput. Sci. 121(1&2): 89-112 (1993) - [c9]Scott F. Smith, Amy E. Zwarico:
Correct Compilation of Specifications to Deterministic Asynchronous Circuits. CHARME 1993: 179-190 - 1992
- [c8]Gul Agha, Ian A. Mason, Scott F. Smith, Carolyn L. Talcott:
Towards a Theory of Actor Computation. CONCUR 1992: 565-579 - [c7]Furio Honsell, Ian A. Mason, Scott F. Smith, Carolyn L. Talcott:
A Theory of Classes for a Functional Language with Effects. CSL 1992: 309-326 - [c6]Scott F. Smith, Amy E. Zwarico:
Provably Correct Synthesis of Asynchronous Circuits. Designing Correct Circuits 1992: 237-260 - 1991
- [c5]Scott F. Smith:
Extracting Recursive Programs in Type Theory. AMAST 1991: 341-349 - [c4]Scott F. Smith:
Reflective Semantics of Constructive Type Theory: Preliminary Report. Constructivity in Computer Science 1991: 33-45 - [c3]Scott F. Smith:
From Operational to Denotational Semantics. MFPS 1991: 54-76
1980 – 1989
- 1989
- [b2]Scott F. Smith:
Partial Objects in Type Theory. Cornell University, USA, 1989 - 1988
- [c2]Robert L. Constable, Scott F. Smith:
Computational Foundations of Basic Recursive Function Theory. LICS 1988: 360-371 - 1987
- [c1]Robert L. Constable, Scott F. Smith:
Partial Objects In Constructive Type Theory. LICS 1987: 183-193 - 1986
- [b1]Robert L. Constable, Stuart F. Allen, Mark Bromley, Rance Cleaveland, J. F. Cremer, Robert Harper, Douglas J. Howe, Todd B. Knoblock, Nax Paul Mendler, Prakash Panangaden, James T. Sasaki, Scott F. Smith:
Implementing mathematics with the Nuprl proof development system. Prentice Hall 1986, ISBN 978-0-13-451832-9, pp. I-X, 1-299
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-16 20:33 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: