Sciweavers

1760 search results - page 87 / 352
» Program Analysis Using Weighted Pushdown Systems
Sort
View
ICML
2005
IEEE
16 years 1 months ago
Learning the structure of Markov logic networks
Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. In this pap...
Stanley Kok, Pedro Domingos
99
Voted
ICTAC
2009
Springer
15 years 7 months ago
A Deadlock-Free Semantics for Shared Memory Concurrency
Abstract. We design a deadlock-free semantics for a concurrent, functional and imperative programming language where locks are implicitly and univocally associated with pointers. T...
Gérard Boudol
115
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
DSVIS
1998
Springer
15 years 4 months ago
Pragmatic Formal Design: A Case Study in Integrating Formal Methods into the HCI Development Cycle
Formal modelling, in interactive system design, has received considerably less real use than might have been hoped. Heavy weight formal methods can be expensive to use, with poor c...
Meurig Sage, Chris Johnson
92
Voted
ICSM
2009
IEEE
15 years 7 months ago
Using information retrieval to support software maintenance tasks
This paper presents an approach based on Information Retrieval (IR) techniques for extracting and representing the unstructured information in large software systems such that it ...
Denys Poshyvanyk