Sciweavers

500 search results - page 66 / 100
» Thread-Modular Abstraction Refinement
Sort
View
CORR
2010
Springer
98views Education» more  CORR 2010»
14 years 9 months ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...
ALGORITHMICA
2006
97views more  ALGORITHMICA 2006»
14 years 9 months ago
Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and
Abstract. In this paper we prove the optimality and other properties of the -adic nonadjacent form: this expansion has been introduced in order to efficiently compute scalar multip...
Roberto Maria Avanzi, Clemens Heuberger, Helmut Pr...
ALGORITHMICA
2006
63views more  ALGORITHMICA 2006»
14 years 9 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»
14 years 9 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»
14 years 9 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