Sciweavers

55 search results - page 10 / 11
» Automatic induction proofs of data-structures in imperative ...
Sort
View
POPL
2008
ACM
15 years 11 months ago
Engineering formal metatheory
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
Arthur Charguéraud, Benjamin C. Pierce, Bri...
GECCO
2008
Springer
123views Optimization» more  GECCO 2008»
15 years 7 days ago
MLS security policy evolution with genetic programming
In the early days a policy was a set of simple rules with a clear intuitive motivation that could be formalised to good effect. However the world is becoming much more complex. S...
Yow Tzu Lim, Pau-Chen Cheng, Pankaj Rohatgi, John ...
TPHOL
2009
IEEE
15 years 5 months ago
A Formalisation of Smallfoot in HOL
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,...
Thomas Tuerk
BIRTHDAY
2003
Springer
15 years 2 months ago
Aspect Validation Using Model Checking
Aspects are intended to add needed functionality to a system or to treat concerns of the system by augmenting or changing the existing code in a manner that cross-cuts the usual c...
Shmuel Katz, Marcelo Sihman
CSL
2010
Springer
15 years 8 days ago
Embedding Deduction Modulo into a Prover
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...
Guillaume Burel