APLAS 2013
26 papers
- A Hoare Logic for SIMT Programs
- Ambivalent Types for Principal Type Inference with GADTs
- Automated Inference of Library Specifications for Source-Sink Property Verification
- Bi-Abduction with Pure Properties for Specification Inference
- Brzozowski's and Up-To Algorithms for Must Testing
- Dynamic Alias Protection with Aliasing Contracts
- Environmental Bisimulations for Delimited-Control Operators
- Fine-Grained Function Visibility for Multiple Dispatch with Multiple Inheritance
- GDSL: A Universal Toolkit for Giving Semantics to Machine Language
- Generalized Quantitative Analysis of Metric Transition Systems
- Internal Deployment of the Parfait Static Code Analysis Tool at Oracle - (Invited Talk)
- Laws of Programming for References
- Model Checking Dynamic Pushdown Networks
- On Bar Recursion and Choice in a Classical Setting
- Paragon for Practical Programming with Information-Flow Control
- Practical Alternating Parity Tree Automata Model Checking of Higher-Order Recursion Schemes
- Proofs, Upside Down - A Functional Correspondence between Natural Deduction and the Sequent Calculus
- Robustness Analysis of Finite Precision Implementations
- Secure Compilation of Object-Oriented Components to Protected Module Architectures
- Semantics of Probabilistic Programs: A Weak Limit Approach
- Separation Logic Modulo Theories
- Sorting and Searching by Distribution: From Generic Discrimination to Generic Tries
- Temporal Specification Mining for Anomaly Analysis
- The Proof Assistant as an Integrated Development Environment
- The Undefined Domain: Precise Relational Information for Entities That Do Not Exist
- ThisJava: An Extension of Java with Exact Types