Sciweavers

279 search results - page 31 / 56
» Determinacy Inference for Logic Programs
Sort
View
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
13 years 6 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
FLOPS
2004
Springer
14 years 1 months ago
Backward Pair Sharing Analysis
This paper presents a backward sharing analysis for logic programs. The analysis computes pre-conditions for a query that guarantee a given post-condition is satisfied after the q...
Lunjin Lu, Andy King
ESOP
2010
Springer
14 years 5 months ago
Amortised Resource Analysis with Separation Logic
Type-based amortised resource analysis following Hofmann and Jost--where resources are associated with individual elements of data structures and doled out to the programmer under ...
Robert Atkey
AMAST
2008
Springer
13 years 10 months ago
Generating Specialized Rules and Programs for Demand-Driven Analysis
Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and quer...
K. Tuncay Tekle, Katia Hristova, Yanhong A. Liu
CADE
2010
Springer
13 years 9 months ago
Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...
Brigitte Pientka, Joshua Dunfield