Sciweavers

1356 search results - page 62 / 272
» The ideal of verified software
Sort
View
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
16 years 2 days ago
A comparison of flexible schemas for software as a service
A multi-tenant database system for Software as a Service (SaaS) should offer schemas that are flexible in that they can be extended for different versions of the application and d...
Stefan Aulbach, Dean Jacobs, Alfons Kemper, Michae...
FSEN
2007
Springer
15 years 6 months ago
Is Your Security Protocol on Time ?
Abstract. In this paper we offer a novel methodology for verifying correctness of (timed) security protocols. The idea consists in computing the time of a correct execution of a s...
Gizela Jakubowska, Wojciech Penczek
ENTCS
2008
125views more  ENTCS 2008»
14 years 12 months ago
Can Refinement be Automated?
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...
Peter Höfner, Georg Struth
HPCA
2006
IEEE
16 years 6 days ago
Retention-aware placement in DRAM (RAPID): software methods for quasi-non-volatile DRAM
Measurements of an off-the-shelf DRAM chip confirm that different cells retain information for different amounts of time. This result extends to DRAM rows, or pages (retention tim...
Ravi K. Venkatesan, Stephen Herr, Eric Rotenberg
PPOPP
1997
ACM
15 years 4 months ago
Performance Implications of Communication Mechanisms in All-Software Global Address Space Systems
Global addressing of shared data simplifies parallel programming and complements message passing models commonly found in distributed memory machines. A number of programming sys...
Beng-Hong Lim, Chi-Chao Chang, Grzegorz Czajkowski...