Sciweavers

1156 search results - page 162 / 232
» Compositional Methods for Information-Hiding
Sort
View
CAV
1998
Springer
103views Hardware» more  CAV 1998»
13 years 12 months 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...
FM
2006
Springer
113views Formal Methods» more  FM 2006»
13 years 11 months ago
Interface Input/Output Automata
We propose a new look at one of the most fundamental types of behavioral interfaces: discrete time specifications of communication--directly related to the work of de Alfaro and H...
Kim Guldstrand Larsen, Ulrik Nyman, Andrzej Wasows...
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
13 years 11 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
FTRTFT
2000
Springer
13 years 11 months ago
Modeling Faults of Distributed, Reactive Systems
Formal methods can improve the development of systems with high quality requirements, since they usually o er a precise, nonambiguous speci cation language and allow rigorous veri ...
Max Breitling
ECOOP
2008
Springer
13 years 9 months ago
Integrating Nominal and Structural Subtyping
Nominal and structural subtyping each have their own strengths and weaknesses. Nominal subtyping allows programmers to explicitly express design intent, and, when types are associa...
Donna Malayeri, Jonathan Aldrich