1138 search results - page 205 / 228 » First-Order Model Checking Problems Parameterized by the Mod... |
147
Voted
ISSTA
2006
ACM
15 years 8 months ago
2006
ACM
We present initial work on perturbation techniques that cause the manifestation of timing-related bugs in distributed memory Message Passing Interface (MPI)-based applications. Th...
129
click to vote
MMB
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Bisimulation reduction is a classical means to fight the infamous state space explosion problem, which limits the applicability of automated methods for verification li...
138
Voted
CIE
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
106
Voted
DAC
2002
ACM
16 years 3 months ago
2002
ACM
We propose Satisfiability Checking (SAT) techniques that lead to a consistent performance improvement of up to 3x over state-ofthe-art SAT solvers like Chaff on important problem ...
124
Voted
ISRR
2005
Springer
15 years 8 months ago
2005
Springer
An open problem in Simultaneous Localization and Mapping (SLAM) is the development of algorithms which scale with the size of the environment. A few promising methods exploit the ...