313 search results - page 62 / 63 » Formalizing the Halting Problem in a Constructive Type Theor... |
POPL
2005
ACM
14 years 6 months ago
2005
ACM
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission be...
INFOCOM
2008
IEEE
14 years 22 days ago
2008
IEEE
— Many tasks require multiple sensing capabilities; in Wireless Sensor Networks (WSN), it is expensive to deploy a homogeneous network wherein every sensor has the same functiona...
VSTTE
2005
Springer
13 years 11 months ago
2005
Springer
How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and p...
ICTAC
2010
Springer
13 years 4 months ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
ITICSE
2006
ACM
14 years 8 days ago
2006
ACM
The release of Curriculum 2001 coupled with the increasing importance of the World Wide Web and the changes in pedagogy enabled by new technologies has made the choices about what...