23 search results - page 4 / 5 » ILC: A Foundation for Automated Reasoning About Pointer Prog... |
CSL
2010
Springer
13 years 6 months ago
2010
Springer
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
ICLP
1989
Springer
13 years 9 months ago
1989
Springer
The generation of efficient code for Prolog programs requires sophisticated code transformation and optimization systems. Much of the recent work in this area has focussed on hig...
TPHOL
2009
IEEE
13 years 12 months ago
2009
IEEE
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
We present Low-Level Liquid Types, a refinement type system for C based on Liquid Types. Low-Level Liquid Types combine refinement types with three key elements to automate verifi...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...