Sciweavers

738 search results - page 16 / 148
» Formal Methods: for All or for Chosen
Sort
View
KI
2006
Springer
13 years 7 months ago
A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
Rüdiger Ebendt, Rolf Drechsler
SAC
2010
ACM
14 years 2 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil
ICSE
1999
IEEE-ACM
13 years 11 months ago
A Practical Method for Verifying Event-Driven Software
Formal verification methods are used only sparingly in software development. The most successful methods to date are based on the use of model checking tools. To use such he user ...
Gerard J. Holzmann, Margaret H. Smith
WCRE
1999
IEEE
13 years 11 months ago
Experiments with Clustering as a Software Remodularization Method
As valuable software systems get old, reverse engineering becomes more and more important to the companies that have to maintain the code. Clustering is a key activity in reverse ...
Nicolas Anquetil, Timothy Lethbridge
PVM
2007
Springer
14 years 1 months ago
Practical Model-Checking Method for Verifying Correctness of MPI Programs
Formal program verification often requires creating a model of the program and running it through a model-checking tool. However, this model-creation step is itself error prone, t...
Salman Pervez, Ganesh Gopalakrishnan, Robert M. Ki...