4460 search results - page 172 / 892 » Formal methods for interactive systems |
127
Voted
AAAI
1993
15 years 5 months ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
123
click to vote
SAS
2009
Springer
16 years 4 months ago
2009
Springer
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
109
Voted
FMICS
2009
Springer
15 years 10 months ago
2009
Springer
In joint work with Cristiano Calcagno, Peter O’Hearn, and Hongseok Yang, we have introduced bi-abductive inference and its use in reasoning about heap manipulating programs [5]. ...
122
Voted
ZUM
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we use Z to capture the requirements for an ‘intuitive’ menu navigation system as a series of conjectures that should hold. We use those requirements to investiga...
157
Voted
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
We present a formalization of a proof of self-stabilization in the Coq proof assistant. Coq is a program allowing to define mathematical objects and properties, and to make proof...