Sciweavers

780 search results - page 150 / 156
» Reasoning about sets using redescription mining
Sort
View
113
Voted
IJCSA
2006
91views more  IJCSA 2006»
15 years 3 months ago
Possibilistic Explanation
The philosophy literature has been struggling with the problem of defining causality. There has been extensive discussion about it. Hume taught that talk of causation was metaphys...
Sara Boutouhami, Aïcha Mokhtari
139
Voted
JUCS
2007
90views more  JUCS 2007»
15 years 3 months ago
High-level Structured Interactive Programs with Registers and Voices
Abstract: A model (consisting of rv-systems), a core programming language (for developing rv-programs), several specification and analysis techniques appropriate for modeling, pro...
Alexandru Popa, Alexandru Sofronia, Gheorghe Stefa...
129
Voted
POPL
2010
ACM
16 years 28 days ago
Counterexample-Guided Focus
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
Andreas Podelski, Thomas Wies
118
Voted
DCC
2010
IEEE
15 years 10 months ago
Lossless Data Compression via Substring Enumeration
We present a technique that compresses a string w by enumerating all the substrings of w. The substrings are enumerated from the shortest to the longest and in lexicographic order...
Danny Dubé, Vincent Beaudoin
121
Voted
ASPLOS
2010
ACM
15 years 10 months ago
ConMem: detecting severe concurrency bugs through an effect-oriented approach
Multicore technology is making concurrent programs increasingly pervasive. Unfortunately, it is difficult to deliver reliable concurrent programs, because of the huge and non-det...
Wei Zhang, Chong Sun, Shan Lu