Sciweavers

239 search results - page 44 / 48
» Proof Techniques for Cryptographic Processes
Sort
View
CAV
1998
Springer
103views Hardware» more  CAV 1998»
14 years 27 days ago
You Assume, We Guarantee: Methodology and Case Studies
Assume-guarantee reasoning has long been advertised as an important method for decomposing proof obligations in system veri cation. Re nement mappings (homomorphisms) have long bee...
Thomas A. Henzinger, Shaz Qadeer, Sriram K. Rajama...
IPCO
1998
99views Optimization» more  IPCO 1998»
13 years 10 months ago
Non-approximability Results for Scheduling Problems with Minsum Criteria
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeging...
CORR
2011
Springer
148views Education» more  CORR 2011»
13 years 3 months ago
On Social-Temporal Group Query with Acquaintance Constraint
Three essential criteria are important for activity planning, including: (1) finding a group of attendees familiar with the initiator, (2) ensuring each attendee in the group to ...
De-Nian Yang, Yi-Ling Chen, Wang-Chien Lee, Ming-S...
DICS
2006
13 years 10 months ago
Dependable Software
Achieving software reliability takes many complementary techniques, directed at the process or at the products. This survey summarizes some of the most fruitful ideas. 1 OVERVIEW ...
Bertrand Meyer
CORR
2009
Springer
242views Education» more  CORR 2009»
13 years 6 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...