Sciweavers

1532 search results - page 59 / 307
» The Symbol Grounding Problem
Sort
View
SPIN
2010
Springer
15 years 2 months ago
An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models
This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relax...
Alexander Linden, Pierre Wolper
ICCAD
2010
IEEE
124views Hardware» more  ICCAD 2010»
15 years 1 months ago
Symbolic performance analysis of elastic systems
Elastic systems, either synchronous or asynchronous, can be optimized for the average-case performance when they have units with early evaluation or variable latency. The performan...
Marc Galceran Oms, Jordi Cortadella, Michael Kishi...
120
Voted
DIAGRAMS
2004
Springer
15 years 9 months ago
An Architecture for Problem Solving with Diagrams
In problem solving a goal/subgoal is either solved by generating needed information from current information, or further decomposed into additional subgoals. In traditional problem...
B. Chandrasekaran, Unmesh Kurup, Bonny Banerjee, J...
142
Voted
ICFEM
2009
Springer
15 years 1 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
FMCAD
2004
Springer
15 years 9 months ago
Approximate Symbolic Model Checking for Incomplete Designs
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...
Tobias Nopper, Christoph Scholl