Sciweavers

1040 search results - page 23 / 208
» Tools for modeling and solving search problems
Sort
View
ENTCS
2006
162views more  ENTCS 2006»
13 years 7 months ago
Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans
The current paper makes two contributions for the graph pattern matching problem of model transformation tools. First, model-sensitive search plan generation is proposed for patte...
Gergely Varró, Katalin Friedl, Dánie...
CADE
2012
Springer
11 years 10 months 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...
ISSRE
2002
IEEE
14 years 17 days ago
Saturation Effects in Testing of Formal Models
Formal analysis of software is a powerful analysis tool, but can be too costly. Random search of formal models can reduce that cost, but is theoretically incomplete. However, rand...
Tim Menzies, David Owen, Bojan Cukic
DAM
2007
94views more  DAM 2007»
13 years 7 months ago
New formulations for the Kissing Number Problem
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
Sergei Kucherenko, Pietro Belotti, Leo Liberti, Ne...
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 6 months ago
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
Silvio Ghilardi, Silvio Ranise