Sciweavers

1999 search results - page 194 / 400
» Dependently Typed Grammars
Sort
View
ICCBR
1999
Springer
15 years 10 months ago
When Experience Is Wrong: Examining CBR for Changing Tasks and Environments
Case-based problem-solving systems reason and learn from experiences, building up case libraries of problems and solutions to guide future reasoning. The expected bene ts of this l...
David B. Leake, David C. Wilson
ISSTA
1998
ACM
15 years 10 months ago
Verifying Systems with Integer Constraints and Boolean Predicates: A Composite Approach
Symbolic model checking has proved highly successful for large nite-state systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants...
Tevfik Bultan, Richard Gerber, Christopher League
DDECS
2009
IEEE
149views Hardware» more  DDECS 2009»
15 years 10 months ago
Physical design oriented DRAM Neighborhood Pattern Sensitive Fault testing
Although the Neighborhood Pattern Sensitive Fault (NPSF) model is recognized as a high quality fault model for memory arrays, the excessive test application time cost associated wi...
Yiorgos Sfikas, Yiorgos Tsiatouhas
CSFW
2004
IEEE
15 years 10 months ago
Secure Information Flow by Self-Composition
Non-interference is a high-level security property that guarantees the absence of illicit information leakages through executing programs. More precisely, non-interference for a p...
Gilles Barthe, Pedro R. D'Argenio, Tamara Rezk
FLOPS
2006
Springer
15 years 10 months ago
iData for the World Wide Web - Programming Interconnected Web Forms
Abstract. In this paper we present the iData Toolkit. It allows programmers to create interactive, dynamic web applications with state on evel of abstraction. The key element of th...
Rinus Plasmeijer, Peter Achten