Sciweavers

2607 search results - page 476 / 522
» Complete Functional Synthesis
Sort
View
CTRSA
2009
Springer
128views Cryptology» more  CTRSA 2009»
14 years 4 months ago
Short Redactable Signatures Using Random Trees
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
Ee-Chien Chang, Chee Liang Lim, Jia Xu
ICST
2009
IEEE
14 years 4 months ago
Optimizing Probabilities of Real-Time Test Case Execution
—Model-based test derivation for real-time system has been proven to be a hard problem for exhaustive test suites. Therefore, techniques for real-time testing do not aim to exhau...
Nicolás Wolovick, Pedro R. D'Argenio, Hongy...
ICST
2009
IEEE
14 years 4 months ago
Unit Testing Non-functional Concerns of Component-based Distributed Systems
Unit testing component-based distributed systems traditionally involved testing functional concerns of the application logic throughout the development lifecycle. In contrast, tes...
James H. Hill, Hamilton A. Turner, James R. Edmond...
INFOCOM
2009
IEEE
14 years 4 months ago
Lightweight Remote Image Management for Secure Code Dissemination in Wireless Sensor Networks
Abstract—Wireless sensor networks are considered ideal candidates for a wide range of applications. It is desirable and sometimes necessary to reprogram sensor nodes through wire...
An Liu, Peng Ning, Chun Wang
TPHOL
2009
IEEE
14 years 4 months ago
A Formalisation of Smallfoot in HOL
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
Thomas Tuerk