On Bar Recursion and Choice in a Classical Setting
Abstract elided by the publisher.
613 papers · page 13 of 31
Brzozowski's and Up-To Algorithms for Must Testing
Abstract elided by the publisher.
Paragon for Practical Programming with Information-Flow Control
Abstract elided by the publisher.
Internal Deployment of the Parfait Static Code Analysis Tool at Oracle - (Invited Talk)
Abstract elided by the publisher.
Generalized Quantitative Analysis of Metric Transition Systems
Abstract elided by the publisher.
Practical Alternating Parity Tree Automata Model Checking of Higher-Order Recursion Schemes
Abstract elided by the publisher.
Ambivalent Types for Principal Type Inference with GADTs
Abstract elided by the publisher.
Robustness Analysis of Finite Precision Implementations
A desirable property of control systems is robustness to inputs, when small perturbations of the inputs of a system will cause only small perturbations on outputs. This property should be maintained at the implementation level, where close inputs can lead to different execution p…
Sorting and Searching by Distribution: From Generic Discrimination to Generic Tries
Abstract elided by the publisher.
Fine-Grained Function Visibility for Multiple Dispatch with Multiple Inheritance
Abstract elided by the publisher.
A Hoare Logic for SIMT Programs
Abstract elided by the publisher.
GDSL: A Universal Toolkit for Giving Semantics to Machine Language
Abstract elided by the publisher.
Laws of Programming for References
Abstract elided by the publisher.
ThisJava: An Extension of Java with Exact Types
Abstract elided by the publisher.
Secure Compilation of Object-Oriented Components to Protected Module Architectures
Abstract elided by the publisher.
Separation Logic Modulo Theories
Logical reasoning about program behaviours often requires dealing with heap structures as well as scalar data types. Advances in Satisfiability Modulo Theories (SMT) offer efficient procedures for dealing with scalar values, yet they lack expressive support for dealing with heap …
Semantics of Probabilistic Programs: A Weak Limit Approach
Abstract elided by the publisher.
Proofs, Upside Down - A Functional Correspondence between Natural Deduction and the Sequent Calculus
Abstract elided by the publisher.
The Undefined Domain: Precise Relational Information for Entities That Do Not Exist
Abstract elided by the publisher.
Model Checking Dynamic Pushdown Networks
Abstract elided by the publisher.