Sciweavers

581 search results - page 16 / 117
» An Automata Model for Trees with Ordered Data Values
Sort
View
FMCAD
1998
Springer
15 years 1 months ago
Combining Symbolic Model Checking with Uninterpreted Functions for Out-of-Order Processor Verification
We present a new approach to the verification of hardware systems with data dependencies using temporal logic symbolic model checking. As a benchmark we take Tomasulo's algori...
Sergey Berezin, Armin Biere, Edmund M. Clarke, Yun...
CAV
2009
Springer
215views Hardware» more  CAV 2009»
15 years 10 months ago
Homer: A Higher-Order Observational Equivalence Model checkER
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
David Hopkins, C.-H. Luke Ong
ICMLA
2010
14 years 7 months ago
Classification Models with Global Constraints for Ordinal Data
Ordinal classification is a form of multi-class classification where there is an inherent ordering between the classes, but not a meaningful numeric difference between them. Althou...
Jaime S. Cardoso, Ricardo Sousa
PKDD
2005
Springer
92views Data Mining» more  PKDD 2005»
15 years 3 months ago
Mining Model Trees from Spatial Data
Mining regression models from spatial data is a fundamental task in Spatial Data Mining. We propose a method, namely Mrs-SMOTI, that takes advantage from a tight-integration with s...
Donato Malerba, Michelangelo Ceci, Annalisa Appice
CAV
2006
Springer
133views Hardware» more  CAV 2006»
15 years 1 months ago
Programs with Lists Are Counter Automata
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Ra...