Sciweavers

797 search results - page 130 / 160
» Eliminating Proofs from Programs
Sort
View
108
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
95
Voted
TOPLAS
2008
81views more  TOPLAS 2008»
15 years 14 days ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
114
Voted
SPAA
2009
ACM
16 years 1 months ago
Towards transactional memory semantics for C++
Transactional memory (TM) eliminates many problems associated with lock-based synchronization. Over recent years, much progress has been made in software and hardware implementati...
Tatiana Shpeisman, Ali-Reza Adl-Tabatabai, Robert ...
121
Voted
EMSOFT
2007
Springer
15 years 6 months ago
Design and implementation of a comprehensive real-time java virtual machine
The emergence of standards for programming real-time systems in Java has encouraged many developers to consider its use for systems previously only built using C, Ada, or assembly...
Joshua S. Auerbach, David F. Bacon, Bob Blainey, P...
CGA
1998
15 years 8 days ago
Principles for Information Visualization Spreadsheets
ns, with large, abstract, multidimensional data sets that are visually represented in multiple ways. We illustrate how spreadsheet techniques provide a structured, intuitive, and p...
Ed Huai-hsin Chi, John Riedl, Phillip Barry, Josep...