Sciweavers

923 search results - page 114 / 185
» Proving the value of formal methods
Sort
View
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 12 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
DATE
2010
IEEE
121views Hardware» more  DATE 2010»
15 years 11 months ago
Properties of and improvements to time-domain dynamic thermal analysis algorithms
—Temperature has a strong influence on integrated circuit (IC) performance, power consumption, and reliability. However, accurate thermal analysis can impose high computation co...
Xi Chen, Robert P. Dick, Li Shang
TLDI
2003
ACM
121views Formal Methods» more  TLDI 2003»
15 years 11 months ago
Types for atomicity
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected and nondeterministic interactions between threads. Previous work has addresse...
Cormac Flanagan, Shaz Qadeer
POPL
2007
ACM
16 years 6 months ago
Context logic as modal logic: completeness and parametric inexpressivity
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
CONCUR
2007
Springer
16 years 14 days ago
Fair Cooperative Multithreading
Abstract. We propose a new operational model for shared variable concurrency, in the context of a concurrent, higher-order imperative language `a la ML. In our model the scheduling...
Gérard Boudol