Sciweavers

1128 search results - page 180 / 226
» Little Engines of Proof
Sort
View
115
Voted
COMSWARE
2007
IEEE
15 years 7 months ago
Distributed Fault-Tolerant Topology Control in Static and Mobile Wireless Sensor Networks
— In wireless sensor networks, minimizing power consumption and at the same time maintaining desired properties in the network topology is of prime importance. In this work, we p...
Indranil Saha, Lokesh Kumar Sambasivan, Ranjeet Ku...
ECBS
2007
IEEE
209views Hardware» more  ECBS 2007»
15 years 7 months ago
Aspect-Oriented Modeling of Ubiquitous Web Applications: The aspectWebML Approach
Ubiquitous web applications (UWA) are required to be customizable, meaning their services need to be adaptable towards the context of use, e.g., user, location, time, and device. ...
Andrea Schauerhuber, Manuel Wimmer, Wieland Schwin...
109
Voted
FSTTCS
2007
Springer
15 years 6 months ago
On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography
Abstract. The abstraction of cryptographic operations by term algebras, called DolevYao models or symbolic cryptography, is essential in almost all tool-supported methods for provi...
Michael Backes, Markus Dürmuth, Ralf Küs...
PPOPP
2006
ACM
15 years 6 months ago
Proving correctness of highly-concurrent linearisable objects
We study a family of implementations for linked lists using finegrain synchronisation. This approach enables greater concurrency, but correctness is a greater challenge than for ...
Viktor Vafeiadis, Maurice Herlihy, Tony Hoare, Mar...
FOSSACS
2005
Springer
15 years 6 months ago
Composition and Decomposition in True-Concurrency
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
Sibylle B. Fröschle