Sciweavers

4617 search results - page 680 / 924
» Automation of Diagrammatic Reasoning
Sort
View
EWCBR
2004
Springer
16 years 20 days ago
Feature Selection and Generalisation for Retrieval of Textual Cases
Textual CBR systems solve problems by reusing experiences that are in textual form. Knowledge-rich comparison of textual cases remains an important challenge for these systems. How...
Nirmalie Wiratunga, Ivan Koychev, Stewart Massie
LICS
2003
IEEE
16 years 16 days ago
Labelled Markov Processes: Stronger and Faster Approximations
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
Vincent Danos, Josee Desharnais
ER
1997
Springer
148views Database» more  ER 1997»
15 years 11 months ago
Intelligent Support for Retrieval and Synthesis of Patterns for Object-Oriented Design
Several decades of software engineering research confirm that effective reuse is the only realistic approach to meeting the ever-increasing demands on the software industry. Over ...
Sandeep Purao, Veda C. Storey
CAV
2007
Springer
164views Hardware» more  CAV 2007»
15 years 11 months ago
SAT-Based Compositional Verification Using Lazy Learning
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
Nishant Sinha, Edmund M. Clarke
CSFW
2010
IEEE
15 years 11 months ago
Approximation and Randomization for Quantitative Information-Flow Analysis
—Quantitative information-flow analysis (QIF) is an emerging technique for establishing information-theoretic confidentiality properties. Automation of QIF is an important step...
Boris Köpf, Andrey Rybalchenko