Sciweavers

2514 search results - page 111 / 503
» The use of industrial-strength formal methods
Sort
View
WSDM
2012
ACM
352views Data Mining» more  WSDM 2012»
14 years 1 months ago
Multi-relational matrix factorization using bayesian personalized ranking for social network data
A key element of the social networks on the internet such as Facebook and Flickr is that they encourage users to create connections between themselves, other users and objects. On...
Artus Krohn-Grimberghe, Lucas Drumond, Christoph F...
AGTIVE
2007
Springer
16 years 15 days ago
Graph Rewriting for Hardware Dependent Program Optimizations
We present a compiler internal program optimization that uses graph rewriting. This optimization enables the compiler to automatically use rich instructions (such as SIMD instructi...
Andreas Schösser, Rubino Geiß
CAV
2003
Springer
153views Hardware» more  CAV 2003»
15 years 11 months ago
Interpolation and SAT-Based Model Checking
Abstract. We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circ...
Kenneth L. McMillan
KBSE
2000
IEEE
15 years 10 months ago
Model Checking Programs
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it eas...
Willem Visser, Klaus Havelund, Guillaume P. Brat, ...
SBMF
2010
Springer
129views Formal Methods» more  SBMF 2010»
15 years 1 months ago
Directed Model Checking for B: An Evaluation and New Techniques
ProB is a model checker for high-level formalisms such as B, Event-B, CSP and Z. ProB uses a mixed depth-first/breadth-first search strategy, and in previous work we have argued th...
Michael Leuschel, Jens Bendisposto