67 results on '"Steve Zdancewic"'
Search Results
2. Synthesizing Trajectory Queries from Examples.
3. Tealeaves: Structured Monads for Generic First-Order Abstract Syntax Infrastructure.
4. Counterfactual Explanations for Natural Language Interfaces.
5. Verifying an HTTP Key-Value Server with Interaction Trees and VST.
6. Model-based testing of networked applications.
7. An equational theory for weak bisimulation via generalized parameterized coinduction.
8. From C to interaction trees: specifying, verifying, and testing a networked server.
9. SoK: General Purpose Compilers for Secure Multi-Party Computation.
10. A Formal Equational Theory for Call-By-Push-Value.
11. Verifying dynamic race detection.
12. The linearity Monad.
13. QWIRE: a core language for quantum circuits.
14. Linear λμ is CP (more or less).
15. Example-directed synthesis: a type-theoretic interpretation.
16. An Axiomatic Specification for Sequential Memory Models.
17. Type-and-example-directed program synthesis.
18. A formal C memory model supporting integer-pointer casts.
19. Everything You Want to Know About Pointer-Based Checking.
20. Finite Vector Spaces as Model of Simply-Typed Lambda-Calculi.
21. A Core Quantitative Coeffect Calculus.
22. Ironclad C++: a library-augmented type-safe subset of c++.
23. Formal verification of SSA-based optimizations for LLVM.
24. Mechanized Verification of Computing Dominators for Formalizing Compilers.
25. Watchdog: Hardware for safe and secure manual memory management and full memory safety.
26. Dependent interoperability.
27. Formalizing the LLVM intermediate representation for verified program transformations.
28. Generative type abstraction and type-level computation.
29. Relational Parametricity for a Polymorphic Linear Lambda Calculus.
30. CETS: compiler enforced temporal safety for C.
31. Lightweight linear types in system fdegree.
32. Lolliproc: to concurrency from classical linear logic via curry-howard and control.
33. SoftBound: highly compatible and complete spatial memory safety for c.
34. Encoding information flow in Aura.
35. Strong and Weak Policy Relations.
36. Reactive noninterference.
37. Updatable Security Views.
38. Hardbound: architectural support for spatial safety of the C programming language.
39. AURA: a programming language for authorization and audit.
40. Evidence-Based Audit.
41. A Cryptographic Decentralized Label Model.
42. Combining events and threads for scalable network services implementation and evaluation of monadic, application-level concurrency primitives.
43. Preserving Secrecy Under Refinement.
44. Managing Policy Updates in Security-Typed Languages.
45. It Is Time to Mechanize Programming Language Metatheory.
46. Mechanized Metatheory for the Masses: The PoplMark Challenge.
47. A Design for a Security-Typed Language with Certificate-Based Declassification.
48. Practical Information-flow Control in Web-Based Information Systems.
49. Downgrading policies and relaxed noninterference.
50. Advanced control flow in Java card programming.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.