Sciweavers

326 search results - page 31 / 66
» Logical Engineering with Instance-Based Methods
Sort
View
PPDP
2007
Springer
14 years 3 months ago
Formalizing and verifying semantic type soundness of a simple compiler
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
Nick Benton, Uri Zarfaty
SIGCSE
2005
ACM
179views Education» more  SIGCSE 2005»
14 years 3 months ago
Design patterns for database pedagogy: a proposal
Courses in Relational Databases largely use a domain-specific design approach different from that used in the rest of the curriculum. Use of the Unified Process, UML, and Design P...
Thomas J. Marlowe, Cyril S. Ku, James W. Benham
PKDD
2009
Springer
149views Data Mining» more  PKDD 2009»
14 years 4 months ago
Learning to Disambiguate Search Queries from Short Sessions
Web searches tend to be short and ambiguous. It is therefore not surprising that Web query disambiguation is an actively researched topic. To provide a personalized experience for ...
Lilyana Mihalkova, Raymond J. Mooney
DAC
1994
ACM
14 years 1 months ago
Dynamic Search-Space Pruning Techniques in Path Sensitization
A powerful combinational path sensitization engine is required for the efficient implementation of tools for test pattern generation, timing analysis, and delay fault testing. Path...
João P. Marques Silva, Karem A. Sakallah
IIWAS
2008
13 years 11 months ago
A model-prover for constrained dynamic conversations
In a service-oriented architecture, systems communicate by exchanging messages. In this work, we propose a formal model based on OCL-constrained UML Class diagrams and a methodolo...
Diletta Cacciagrano, Flavio Corradini, Rosario Cul...