920 search results - page 69 / 184 » Generating Satisfiable Problem Instances |
SIGSOFT
2007
ACM
14 years 11 months ago
2007
ACM
This paper presents a specification-based approach for systematic testing of products from a software product line. Our approach uses specifications given as formulas in Alloy, a ...
EUROMICRO
2006
IEEE
14 years 4 months ago
2006
IEEE
This paper presents a modular modelling methodology to formulate the timing behaviour of real-time distributed component-based applications. It allows to build real-time models of...
SEKE
2004
Springer
14 years 4 months ago
2004
Springer
We present an approach for mapping an OWL ontology into Java. The basic idea is to create a set of Java interfaces and classes from an OWL ontology such that an instance of a Java ...
AAAI
2000
14 years 3 days ago
2000
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
ENTCS
2006
13 years 10 months ago
2006
The standard translation of a Bounded Model Checking (BMC) instance into a satisfiability problem, (a.k.a SAT), might produce misleading results in the case when the model under v...