Sciweavers

5128 search results - page 135 / 1026
» When Abstraction Fails
Sort
View
DAM
1999
100views more  DAM 1999»
15 years 6 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder
CODES
2010
IEEE
15 years 4 months ago
A task remapping technique for reliable multi-core embedded systems
With the continuous scaling of semiconductor technology, the life-time of circuit is decreasing so that processor failure becomes an important issue in MPSoC design. A software so...
Chanhee Lee, Hokeun Kim, Hae-woo Park, Sungchan Ki...
WISE
2009
Springer
16 years 1 months ago
An Integrated Declarative Approach to Web Services Composition and Monitoring
Abstract. In this paper we propose a constraint based declarative approach for Web services composition and monitoring problem. Our apllows user to build the abstract composition b...
Ehtesham Zahoor, Olivier Perrin, Claude Godart
ETRICS
2006
15 years 10 months ago
Possibilistic Information Flow Control in MAKS and Action Refinement
Abstract. Formal methods emphasizes the need for a top-down approach when developing large reliable software systems. Refinements are map step by step abstract algebraic specificat...
Dieter Hutter
AMAI
2004
Springer
15 years 11 months ago
Combining Symmetry Breaking with Other Constraints: Lexicographic Ordering with Sums
Abstract. We introduce a new global constraint which combines together the lexicographic ordering constraint with two sum constraints. Lexicographic ordering constraints are freque...
Brahim Hnich, Zeynep Kiziltan, Toby Walsh