162 results on '"Thomas Wies"'
Search Results
2. Deciding Subtyping for Asynchronous Multiparty Sessions.
3. nekton: A Linearizability Proof Checker.
4. Complete Multiparty Session Type Projection with Automata.
5. Less is more: refinement proofs for probabilistic proofs.
6. Make Flows Small Again: Revisiting the Flow Framework.
7. Verifying Concurrent Search Structures (Invited Talk).
8. Needles in a Haystack: Using PORT to Catch Bad Behaviors within Application Recordings.
9. Inverse-Weighted Survival Games.
10. Automated Verification of Concurrent Search Structures
11. TarTar: A Timed Automata Repair Tool.
12. Verifying concurrent search structure templates.
13. Local Reasoning for Global Graph Properties.
14. Automated Verification of Concurrent Search Structures
15. Charting a Course Through Uncertain Environments: SEA Uses Past Problems to Avoid Future Failures.
16. VACCINE: Using Contextual Integrity For Data Leakage Detection.
17. Clock Bound Repair for Timed Systems.
18. RECIPE: Applying Open Domain Question Answering to Privacy Policies.
19. Partitioned Memory Models for Program Analysis.
20. Full Accounting for Verifiable Outsourcing.
21. Error Invariants for Concurrent Traces.
22. Classifying Bugs with Interpolants.
23. Learning Privacy Expectations by Crowdsourcing Contextual Informational Norms.
24. Conflict-Directed Graph Coverage.
25. VERMEER: A Tool for Tracing and Explaining Faulty C Programs.
26. Deciding Local Theory Extensions via E-matching.
27. Practical SMT-based type error localization.
28. Finding minimum type error sources.
29. Cascade 2.0.
30. Automating Separation Logic with Trees and Data.
31. Dynamic Package Interfaces.
32. GRASShopper - Complete Heap Verification with Mixed Specifications.
33. Concolic Fault Localization.
34. Make Flows Small Again: Revisiting the Flow Framework
35. Explaining inconsistent code.
36. Flow-Sensitive Fault Localization.
37. Automating Separation Logic Using SMT.
38. Structural Counter Abstraction.
39. Complete instantiation-based interpolation.
40. Error Invariants.
41. Ideal Abstractions for Well-Structured Transition Systems.
42. Deciding Functional Lists with Sublist Sets.
43. Scheduling large jobs by abstraction refinement.
44. Decision Procedures for Automating Termination Proofs.
45. An Efficient Decision Procedure for Imperative Tree Data Structures.
46. Forward Analysis of Depth-Bounded Processes.
47. Building a Calculus of Data Structures.
48. FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment.
49. A marketplace for cloud resources.
50. Counterexample-guided focus.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.