The following pages link to Ilya Sergey (Q763479):
Displayed 17 items.
- A correspondence between type checking via reduction and type checking via evaluation (Q763480) (← links)
- Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper) (Q832157) (← links)
- Certifying certainty and uncertainty in approximate membership query structures (Q2226742) (← links)
- Automated repair of heap-manipulating programs using deductive synthesis (Q2234087) (← links)
- Paxos consensus, deconstructed and abstracted (Q2324015) (← links)
- Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity (Q2802440) (← links)
- Pushdown flow analysis with abstract garbage collection (Q2875231) (← links)
- Gradual Ownership Types (Q2892752) (← links)
- Calculating Graph Algorithms for Dominance and Shortest Path (Q2908564) (← links)
- Experience report: growing and shrinking polygons for random testing of computational geometry algorithms (Q2982014) (← links)
- Protocol combinators for modeling, testing, and execution of distributed systems (Q5018776) (← links)
- Concise Read-Only Specifications for Better Synthesis of Programs with Pointers (Q5041091) (← links)
- Engineering Distributed Systems that We Can Trust (and Also Run) (Q5145226) (← links)
- Introspective pushdown analysis of higher-order programs (Q5168912) (← links)
- Modular, higher order cardinality analysis in theory and practice (Q5372006) (← links)
- Modular, higher-order cardinality analysis in theory and practice (Q5408429) (← links)
- Communicating State Transition Systems for Fine-Grained Concurrent Resources (Q5410705) (← links)