Automata-Based Abstraction for Automated Verification of Higher-Order Tree-Processing Programs
Abstract elided by the publisher.
613 papers · page 11 of 31
Fault-Tolerant Resource Reasoning
Abstract elided by the publisher.
Detection of Redundant Expressions: A Complete and Polynomial-Time Algorithm in SSA
Abstract elided by the publisher.
From Call-by-Value to Interaction by Typed Closure Conversion
Abstract elided by the publisher.
Shifting the Blame - A Blame Calculus with Delimited Control
Abstract elided by the publisher.
Aliasing Control in an Imperative Pure Calculus
Abstract elided by the publisher.
More Sound Static Handling of Java Reflection
Reflection is a highly dynamic language feature that poses grave problems for static analyses. In the Java setting, reflection is ubiquitous in large programs. Any handling of reflection will be approximate, and overestimating its reach in a large codebase can be catastrophic for…
Analyzing Distributed Multi-platform Java and Android Applications with ShadowVM
Abstract elided by the publisher.
Separation Logic with Monadic Inductive Definitions and Implicit Existentials
Abstract elided by the publisher.
Memory-Efficient Tail Calls in the JVM with Imperative Functional Objects
Abstract elided by the publisher.
Quasi-Linearizability is Undecidable
Abstract elided by the publisher.
Uncovering JavaScript Performance Code Smells Relevant to Type Mutations
Abstract elided by the publisher.
Programming with "Big Code"
Abstract elided by the publisher.
A Formalized Proof of Strong Normalization for Guarded Recursive Types
Abstract elided by the publisher.
Resource Protection Using Atomics - Patterns and Verification
Abstract elided by the publisher.
Logic Programming and Logarithmic Space
We present an algebraic view on logic programming, related to proof theory and more specifically linear logic and geometry of interaction. Within this construction, a characterization of logspace (deterministic and non-deterministic) computation is given via a syntactic restricti…
Hereditary History-Preserving Bisimilarity: Logics and Automata
Abstract elided by the publisher.
A Precise and Abstract Memory Model for C Using Symbolic Values
Abstract elided by the publisher.
Simple and Efficient Algorithms for Octagons
Abstract elided by the publisher.
Suppl: A Flexible Language for Policies
Abstract elided by the publisher.