Sciweavers

ENTCS
2008
88views more  ENTCS 2008»
13 years 11 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
2008
113views more  ENTCS 2008»
13 years 11 months ago
Automatic Verification of Combined Specifications: An Overview
This paper gives an overview of results of the project "Beyond Timed Automata" carried out in the Collaborative Research Center AVACS (Automatic Verification and Analysi...
Ernst-Rüdiger Olderog
ENTCS
2008
118views more  ENTCS 2008»
13 years 11 months ago
Barbed Model-Driven Software Development: A Case Study
When thinking of MDE, the immediate understanding is that models drive software development, in the at the software is constructed by transforming models from higher levels of abs...
Carlo Montangero, Laura Semini
ENTCS
2008
95views more  ENTCS 2008»
13 years 11 months ago
Generic Tools via General Refinement
Steve Reeves, David Streader
ENTCS
2008
110views more  ENTCS 2008»
13 years 11 months ago
A New Proposal Of Quasi-Solved Form For Equality Constraint Solving
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...
Javier Álvez, Paqui Lucio
ENTCS
2008
103views more  ENTCS 2008»
13 years 11 months ago
Systematic Semantic Tableaux for PLTL
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
ENTCS
2008
128views more  ENTCS 2008»
13 years 11 months ago
Algebraic Stuttering Simulations
Rewrite theories and their associated Kripke structures constitute a flexible and executable framework in which a wide range of systems can be studied. We present a general notion...
Narciso Martí-Oliet, José Meseguer, ...
ENTCS
2008
140views more  ENTCS 2008»
13 years 11 months ago
Functions and Lazy Evaluation in Prolog
There are several proposals for extending Prolog with functional capabilities. The basic idea is to enlarge the language with function definitions that are translated (or expanded...
Juan Rodríguez-Hortalá, Jaime S&aacu...
ENTCS
2008
85views more  ENTCS 2008»
13 years 11 months ago
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
Salvador Lucas, Rafael Navarro-Marset