Sciweavers

378 search results - page 11 / 76
» Complete Interval Arithmetic and Its Implementation on the C...
Sort
View
CSL
2008
Springer
14 years 11 months ago
Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T
Interval logics are an important area of computer science. Although attention has been mainly focused on unary operators, an early work by Venema (1991) introduced an expressively ...
Ian Hodkinson, Angelo Montanari, Guido Sciavicco
LFCS
2007
Springer
15 years 3 months ago
On Decidability and Expressiveness of Propositional Interval Neighborhood Logics
Interval-based temporal logics are an important research area in computer science and artificial intelligence. In this paper we investigate decidability and expressiveness issues ...
Davide Bresolin, Valentin Goranko, Angelo Montanar...
DATE
2006
IEEE
104views Hardware» more  DATE 2006»
15 years 3 months ago
Equivalence verification of arithmetic datapaths with multiple word-length operands
Abstract: This paper addresses the problem of equivalence verification of RTL descriptions that implement arithmetic computations (add, mult, shift) over bitvectors that have di...
Namrata Shekhar, Priyank Kalla, Florian Enescu
CADE
2012
Springer
13 years 36 min ago
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
François Bobot, Sylvain Conchon, Evelyne Co...
ANSS
2007
IEEE
15 years 1 months ago
An Accurate and Efficient Time-Division Parallelization of Cycle Accurate Architectural Simulators
This paper proposes a parallel cycle-accurate microarchitectural simulator which efficiently executes its workload by splitting the simulation process along time-axis into many in...
Masahiro Yano, Toru Takasaki, Takashi Nakada, Hiro...