Steve Zdancewic

Orcid: 0000-0002-3516-1512

Affiliations:
  • University of Pennsylvania, Philadelphia, PA, USA


According to our database1, Steve Zdancewic authored at least 100 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Optimal Program Synthesis via Abstract Interpretation.
Proc. ACM Program. Lang., January, 2024

2023
A Bowtie for a Beast: Overloading, Eta Expansion, and Extensible Data Types in F⋈.
Proc. ACM Program. Lang., January, 2023

Choice Trees: Representing Nondeterministic, Recursive, and Impure Programs in Coq.
Proc. ACM Program. Lang., January, 2023

Semantics for Noninterference with Interaction Trees (Artifact).
Dagstuhl Artifacts Ser., 2023

Syntax Monads for the Working Formal Metatheorist.
CoRR, 2023

Tealeaves: Structured Monads for Generic First-Order Abstract Syntax Infrastructure.
Proceedings of the 14th International Conference on Interactive Theorem Proving, 2023

Semantics for Noninterference with Interaction Trees.
Proceedings of the 37th European Conference on Object-Oriented Programming, 2023

Synthesizing Trajectory Queries from Examples.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022
Formal reasoning about layered monadic interpreters.
Proc. ACM Program. Lang., 2022

C4: verified transactional objects.
Proc. ACM Program. Lang., 2022

Ideograph: A Language for Expressing and Manipulating Structured Data.
Proceedings of the Proceedings Twelfth International Workshop on Computing with Terms and Graphs, 2022

Counterfactual Explanations for Natural Language Interfaces.
Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), 2022

2021
Modular, compositional, and executable formal semantics for LLVM IR.
Proc. ACM Program. Lang., 2021

Dijkstra monads forever: termination-sensitive specifications for interaction trees.
Proc. ACM Program. Lang., 2021

A type system for extracting functional specifications from memory-safe imperative programs.
Proc. ACM Program. Lang., 2021

Verifying an HTTP Key-Value Server with Interaction Trees and VST.
Proceedings of the 12th International Conference on Interactive Theorem Proving, 2021

Model-based testing of networked applications.
Proceedings of the ISSTA '21: 30th ACM SIGSOFT International Symposium on Software Testing and Analysis, 2021

2020
Interaction trees: representing recursive and impure programs in Coq.
Proc. ACM Program. Lang., 2020

Computation focusing.
Proc. ACM Program. Lang., 2020

An equational theory for weak bisimulation via generalized parameterized coinduction.
Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2020

2019
Synthesizing symmetric lenses.
Proc. ACM Program. Lang., 2019

Interaction Trees: Representing Recursive and Impure Programs in Coq (Work In Progress).
CoRR, 2019

A HoTT Quantum Equational Theory (Extended Version).
CoRR, 2019

SoK: General Purpose Compilers for Secure Multi-Party Computation.
Proceedings of the 2019 IEEE Symposium on Security and Privacy, 2019

From C to interaction trees: specifying, verifying, and testing a networked server.
Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2019

2018
Synthesizing bijective lenses.
Proc. ACM Program. Lang., 2018

Synthesizing quotient lenses.
Proc. ACM Program. Lang., 2018

A linear/producer/consumer model of classical linear logic.
Math. Struct. Comput. Sci., 2018

ReQWIRE: Reasoning about Reversible Quantum Circuits.
Proceedings of the Proceedings 15th International Conference on Quantum Physics and Logic, 2018

Structural Operational Semantics for Control Flow Graph Machines.
CoRR, 2018

Technical perspective: Building bug-free compilers.
Commun. ACM, 2018

A Formal Equational Theory for Call-By-Push-Value.
Proceedings of the Interactive Theorem Proving - 9th International Conference, 2018

2017
QWIRE Practice: Formal Verification of Quantum Circuits in Coq.
Proceedings of the Proceedings 14th International Conference on Quantum Physics and Logic, 2017

QWIRE: a core language for quantum circuits.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

The linearity Monad.
Proceedings of the 10th ACM SIGPLAN International Symposium on Haskell, 2017

Verifying dynamic race detection.
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

2016
Example-directed synthesis: a type-theoretic interpretation.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

Linear λμ is CP (more or less).
Proceedings of the A List of Successes That Can Change the World, 2016

2015
VPHL: A Verified Partial-Correctness Logic for Probabilistic Programs.
Proceedings of the 31st Conference on the Mathematical Foundations of Programming Semantics, 2015

Everything You Want to Know About Pointer-Based Checking.
Proceedings of the 1st Summit on Advances in Programming Languages, 2015

Type-and-example-directed program synthesis.
Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2015

A formal C memory model supporting integer-pointer casts.
Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2015

An Axiomatic Specification for Sequential Memory Models.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014
Modeling Simply-Typed Lambda Calculi in the Category of Finite Vector Spaces.
Sci. Ann. Comput. Sci., 2014

Finite Vector Spaces as Model of Simply-Typed Lambda-Calculi.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2014, 2014

A Core Quantitative Coeffect Calculus.
Proceedings of the Programming Languages and Systems, 2014

WatchdogLite: Hardware-Accelerated Compiler-Based Pointer Checking.
Proceedings of the 12th Annual IEEE/ACM International Symposium on Code Generation and Optimization, 2014

2013
Hardware-Enforced Comprehensive Memory Safety.
IEEE Micro, 2013

Formal verification of SSA-based optimizations for LLVM.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2013

Ironclad C++: a library-augmented type-safe subset of c++.
Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages & Applications, 2013

2012
Formalizing the LLVM intermediate representation for verified program transformations.
Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012

Dependent interoperability.
Proceedings of the sixth workshop on Programming Languages meets Program Verification, 2012

Watchdog: Hardware for safe and secure manual memory management and full memory safety.
Proceedings of the 39th International Symposium on Computer Architecture (ISCA 2012), 2012

Mechanized Verification of Computing Dominators for Formalizing Compilers.
Proceedings of the Certified Programs and Proofs - Second International Conference, 2012

2011
Generative type abstraction and type-level computation.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

2010
Arrows for secure information flow.
Theor. Comput. Sci., 2010

Lightweight linear types in system fdegree.
Proceedings of TLDI 2010: 2010 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, 2010

CETS: compiler enforced temporal safety for C.
Proceedings of the 9th International Symposium on Memory Management, 2010

Lolliproc: to concurrency from classical linear logic via curry-howard and control.
Proceedings of the Proceeding of the 15th ACM SIGPLAN international conference on Functional programming, 2010

Relational Parametricity for a Polymorphic Linear Lambda Calculus.
Proceedings of the Programming Languages and Systems - 8th Asian Symposium, 2010

2009
An overview of the Oregon programming languages summer school.
ACM SIGPLAN Notices, 2009

Strong and Weak Policy Relations.
Proceedings of the POLICY 2009, 2009

SoftBound: highly compatible and complete spatial memory safety for c.
Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, 2009

Encoding information flow in Aura.
Proceedings of the 2009 Workshop on Programming Languages and Analysis for Security, 2009

Updatable Security Views.
Proceedings of the 22nd IEEE Computer Security Foundations Symposium, 2009

Reactive noninterference.
Proceedings of the 2009 ACM Conference on Computer and Communications Security, 2009

2008
Joint workshop on foundations of computer security and automated reasoning for security protocol analysis (FCS-ARSPA '06).
Inf. Comput., 2008

AURA: a programming language for authorization and audit.
Proceedings of the Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, 2008

Evidence-Based Audit.
Proceedings of the 21st IEEE Computer Security Foundations Symposium, 2008

Hardbound: architectural support for spatial safety of the C programming language.
Proceedings of the 13th International Conference on Architectural Support for Programming Languages and Operating Systems, 2008

2007
Run-time principals in information-flow type systems.
ACM Trans. Program. Lang. Syst., 2007

A Cryptographic Decentralized Label Model.
Proceedings of the 2007 IEEE Symposium on Security and Privacy (S&P 2007), 2007

Application-level concurrency: combining events and treads: invited talk.
Proceedings of the POPL 2007 Workshop on Declarative Aspects of Multicore Programming, 2007

Combining events and threads for scalable network services implementation and evaluation of monadic, application-level concurrency primitives.
Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, 2007

2006
A type-theoretic interpretation of pointcuts and advice.
Sci. Comput. Program., 2006

Enforcing Robust Declassification and Qualified Robustness.
J. Comput. Secur., 2006

Preserving Secrecy Under Refinement.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Managing Policy Updates in Security-Typed Languages.
Proceedings of the 19th IEEE Computer Security Foundations Workshop, 2006

Encoding Information Flow in Haskell.
Proceedings of the 19th IEEE Computer Security Foundations Workshop, 2006

2005
It Is Time to Mechanize Programming Language Metatheory.
Proceedings of the Verified Software: Theories, 2005

Mechanized Metatheory for the Masses: The PoplMark Challenge.
Proceedings of the Theorem Proving in Higher Order Logics, 18th International Conference, 2005

Downgrading policies and relaxed noninterference.
Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2005

A Design for a Security-Typed Language with Certificate-Based Declassification.
Proceedings of the Programming Languages and Systems, 2005

Practical Information-flow Control in Web-Based Information Systems.
Proceedings of the 18th IEEE Computer Security Foundations Workshop, 2005

2004
Advanced control flow in Java card programming.
Proceedings of the 2004 ACM SIGPLAN/SIGBED Conference on Languages, 2004

Translating dependency into parametricity.
Proceedings of the Ninth ACM SIGPLAN International Conference on Functional Programming, 2004

Enforcing Robust Declassification.
Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004

2003
Formalizing Java-MaC.
Proceedings of the Third Workshop on Run-time Verification, 2003

Using Replication and Partitioning to Build Secure Distributed Systems.
Proceedings of the 2003 IEEE Symposium on Security and Privacy (S&P 2003), 2003

A Type System for Robust Declassification.
Proceedings of 19th Conference on the Mathematical Foundations of Programming Semantics, 2003

A theory of aspects.
Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, 2003

Observational Determinism for Concurrent Program Security.
Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW-16 2003), 30 June, 2003

2002
Programming Languages for Information Security.
PhD thesis, 2002

Secure program partitioning.
ACM Trans. Comput. Syst., 2002

Secure Information Flow via Linear Continuations.
High. Order Symb. Comput., 2002

2001
Untrusted Hosts and Confidentiality: Secure Program Partitioning.
Proceedings of the 18th ACM Symposium on Operating System Principles, 2001

Secure Information Flow and CPS.
Proceedings of the Programming Languages and Systems, 2001

Robust Declassification.
Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14 2001), 2001

2000
Syntactic type abstraction.
ACM Trans. Program. Lang. Syst., 2000

1999
Principals in Programming Languages: A Syntactic Proof Technique.
Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), 1999


  Loading...