Sciweavers

2517 search results - page 123 / 504
» Specifying Weak Sets
Sort
View
ASE
2002
137views more  ASE 2002»
15 years 5 months ago
The DSD Schema Language
XML (Extensible Markup Language), a linear syntax for trees, has gathered a remarkable amount of interest in industry. The acceptance of XML opens new venues for the application o...
Nils Klarlund, Anders Møller, Michael I. Sc...
JIPS
2010
107views more  JIPS 2010»
15 years 9 days ago
Incremental Model-based Test Suite Reduction with Formal Concept Analysis
Test scenarios can be derived based on some system models for requirements validation purposes. Model-based test suite reduction aims to provide a smaller set of test scenarios whi...
Pin Ng, Richard Y. K. Fung, Ray W. M. Kong
CADE
2008
Springer
16 years 5 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
ESOP
2001
Springer
15 years 10 months ago
The Def-inite Approach to Dependency Analysis
Abstract. We propose a new representation for the domain of Definite Boolean functions. The key idea is to view the set of models of a Boolean function as an incidence relation be...
Samir Genaim, Michael Codish
123
Voted
DAC
2010
ACM
15 years 9 months ago
An efficient algorithm to verify generalized false paths
Timing exception verification has become a center of interest as incorrect constraints can lead to chip failures. Proving that a false path is valid or not is a difficult problem ...
Olivier Coudert