Sciweavers

242 search results - page 34 / 49
» Using Abstract State Machines at Microsoft: A Case Study
Sort
View
VMCAI
2009
Springer
14 years 2 months ago
An Abort-Aware Model of Transactional Programming
There has been a lot of recent research on transaction-based concurrent programming, aimed at offering an easier concurrent programming paradigm that enables programmers to better...
Kousha Etessami, Patrice Godefroid
JUCS
2008
166views more  JUCS 2008»
13 years 7 months ago
ASM Refinement Preserving Invariants
: This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal v...
Gerhard Schellhorn
AAAI
1994
13 years 8 months ago
Recovering Software Specifications with Inductive Logic Programming
We consider using machine learning techniques to help understand a large software system. In particular, we describe how learning techniques can be used to reconstruct abstract Da...
William W. Cohen
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
ECML
2007
Springer
14 years 1 months ago
An Improved Model Selection Heuristic for AUC
Abstract. The area under the ROC curve (AUC) has been widely used to measure ranking performance for binary classification tasks. AUC only employs the classifier’s scores to ra...
Shaomin Wu, Peter A. Flach, Cèsar Ferri Ram...