Sciweavers

4224 search results - page 190 / 845
» Reasoning about Choice
Sort
View
SIGSOFT
2005
ACM
16 years 7 months ago
Relational analysis of algebraic datatypes
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
Viktor Kuncak, Daniel Jackson
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
16 years 1 months ago
Incorporating partitioning and parallel plans into the SCOPE optimizer
— Massive data analysis on large clusters presents new opportunities and challenges for query optimization. Data partitioning is crucial to performance in this environment. Howev...
Jingren Zhou, Per-Åke Larson, Ronnie Chaiken
DATE
2006
IEEE
106views Hardware» more  DATE 2006»
16 years 1 months ago
Memory centric thread synchronization on platform FPGAs
Concurrent programs are difficult to write, reason about, re-use, and maintain. In particular, for system-level ions that use a shared memory abstraction for thread or process syn...
Chidamber Kulkarni, Gordon J. Brebner
AIEDAM
2006
89views more  AIEDAM 2006»
15 years 7 months ago
Design space exploration revisited
Design involves reasoning about descriptions of design artefacts, reasoning about design requirements and reasoning about design process objectives (such as keeping to deadlines an...
Pieter H. G. van Langen, Frances M. T. Brazier
IGPL
2006
134views more  IGPL 2006»
15 years 7 months ago
Coherent Conditional Probability in a Fuzzy Logic Setting
Very recently, a (fuzzy modal) logic to reason about coherent conditional probability, in the sense of de Finetti, has been introduced by the authors. Under this approach, a condi...
Lluis Godo, Enrico Marchioni