Sciweavers

239 search results - page 3 / 48
» Data Abstraction and Constraint Solving for Conformance Test...
Sort
View
SIAMSC
2008
182views more  SIAMSC 2008»
13 years 7 months ago
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
Pratik Biswas, Kim-Chuan Toh, Yinyu Ye
FOIKS
2006
Springer
13 years 11 months ago
Equational Constraint Solving Via a Restricted Form of Universal Quantification
Abstract. In this paper, we present a syntactic method for solving firstorder equational constraints over term algebras. The presented method exploits a novel notion of quasi-solve...
Javier Álvez, Paqui Lucio
PTS
2010
175views Hardware» more  PTS 2010»
13 years 5 months ago
Test Data Generation for Programs with Quantified First-Order Logic Specifications
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
Christoph Gladisch
BPSC
2009
240views Business» more  BPSC 2009»
13 years 8 months ago
Modelling and Solving Configuration Problems on Business Processes Using a Multi-Level Constraint Satisfaction Approach
Abstract: In this paper we present our ideas to apply constraint satisfaction on business processes. We propose a multi-level constraint satisfaction approach to handle t levels of...
Wolfgang Runte
TACAS
2009
Springer
127views Algorithms» more  TACAS 2009»
14 years 2 months ago
From Tests to Proofs
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko