25 research outputs found
A Decidable Fragment in Separation Logic with Inductive Predicates and Arithmetic
Singapore National Research Foundatio
Automatically refining partial specifications for Program Verification
10.1007/978-3-642-21437-0_28Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)6664 LNCS369-38
Using Bounded Model Checking to Focus Fixpoint Iterations
Two classical sources of imprecision in static analysis by abstract
interpretation are widening and merge operations. Merge operations can be done
away by distinguishing paths, as in trace partitioning, at the expense of
enumerating an exponential number of paths. In this article, we describe how to
avoid such systematic exploration by focusing on a single path at a time,
designated by SMT-solving. Our method combines well with acceleration
techniques, thus doing away with widenings as well in some cases. We illustrate
it over the well-known domain of convex polyhedra
Inferring disjunctive postconditions
10.1007/978-3-540-77505-8_26Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)4435 LNCS331-34
A type system for resource protocol verification and its correctness proof
Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation135-14
Dual analysis for proving safety and finding bugs
10.1145/1774088.1774538Proceedings of the ACM Symposium on Applied Computing2137-214
A practical and precise inference and specializer for array bound checks elimination
10.1145/1328408.1328434Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation177-18