Sciweavers

507 search results - page 64 / 102
» Counterexample-Guided Abstraction Refinement
Sort
View
ALGORITHMICA
2006
63views more  ALGORITHMICA 2006»
13 years 10 months ago
A Local Limit Theorem in the Theory of Overpartitions
Abstract. An overpartition of an integer n is a partition where the last occurrence of a part can be overlined. We study the weight of the overlined parts of an overpartition count...
Sylvie Corteel, William M. Y. Goh, Pawel Hitczenko
ENTCS
2008
88views more  ENTCS 2008»
13 years 10 months ago
Formal Modelling of Salience and Cognitive Load
Well-designed interfaces use procedural and sensory cues to increase the salience of appropriate actions and intentions. However, empirical studies suggest that cognitive load can...
Rimvydas Ruksenas, Jonathan Back, Paul Curzon, Ann...
ENTCS
2006
134views more  ENTCS 2006»
13 years 10 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening
IJES
2008
101views more  IJES 2008»
13 years 10 months ago
The Artemis workbench for system-level performance evaluation of embedded systems
In this article, we present an overview of the Artemis workbench, which provides modelling and simulation methods and tools for efficient performance evaluation and exploration of ...
Andy D. Pimentel
JIKM
2008
90views more  JIKM 2008»
13 years 10 months ago
Personal Knowledge Management: a Study of Knowledge Behaviour of Academicians
Abstract. Current theories of knowledge management postulate a cycle of knowledge creation, refinement and implementation that hinges on the transformation of tacit, or practical, ...
Monika Mittal