Sciweavers

119 search results - page 14 / 24
» Reasoning about Lists via List Interleaving
Sort
View
115
Voted
TPHOL
2009
IEEE
15 years 7 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
115
Voted
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
16 years 1 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
POPL
1997
ACM
15 years 4 months ago
Shape Types
Type systems currently available for imperative languages are too weak to detect a significant class of programming errors. For example, they cannot express the property that a l...
Pascal Fradet, Daniel Le Métayer
106
Voted
EMSOFT
2007
Springer
15 years 4 months ago
Verification of device drivers and intelligent controllers: a case study
The soundness of device drivers generally cannot be verified in isolation, but has to take into account the reactions of the hardware devices. In critical embedded systems, interf...
David Monniaux
194
Voted
POPL
2008
ACM
16 years 21 days ago
Formal verification of translation validators: a case study on instruction scheduling optimizations
Translation validation consists of transforming a program and a posteriori validating it in order to detect a modification of its semantics. This approach can be used in a verifie...
Jean-Baptiste Tristan, Xavier Leroy