Sciweavers

8094 search results - page 69 / 1619
» Improvements in Formula Generalization
Sort
View
KBSE
2008
IEEE
14 years 3 months ago
Inferring Finite-State Models with Temporal Constraints
Finite state machine-based abstractions of software behaviour are popular because they can be used as the basis for a wide range of (semi-) automated verification and validation ...
Neil Walkinshaw, Kirill Bogdanov
KBSE
2007
IEEE
14 years 3 months ago
Sequential circuits for program analysis
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid
COCO
2007
Springer
89views Algorithms» more  COCO 2007»
14 years 3 months ago
Testing Properties of Constraint-Graphs
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel T...
CONCUR
1999
Springer
14 years 1 months ago
Robust Satisfaction
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...
Orna Kupferman, Moshe Y. Vardi
CLEF
2006
Springer
14 years 23 days ago
A Penalisation-Based Ranking Approach for the Mixed Monolingual Task of WebCLEF 2006
This paper presents an approach of a cross-lingual information retrieval which uses a ranking method based on a penalisation version of the Jaccard formula. The obtained results a...
David Pinto, Paolo Rosso, Ernesto Jiménez