Sciweavers

1895 search results - page 358 / 379
» Using ATL for Checking Models
Sort
View
IANDC
2008
114views more  IANDC 2008»
13 years 7 months ago
Generalizing the Paige-Tarjan algorithm by abstract interpretation
act Interpretation Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy The Paige and Tarjan algorithm (PT) for comp...
Francesco Ranzato, Francesco Tapparo
SIGSOFT
2007
ACM
14 years 8 months ago
Mining API patterns as partial orders from source code: from usage scenarios to specifications
A software system interacts with third-party libraries through various APIs. Using these library APIs often needs to follow certain usage patterns. Furthermore, ordering rules (sp...
Mithun Acharya, Tao Xie, Jian Pei, Jun Xu
TLDI
2009
ACM
155views Formal Methods» more  TLDI 2009»
14 years 4 months ago
Opis: reliable distributed systems in OCaml
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
Pierre-Évariste Dagand, Dejan Kostic, Vikto...
VLDB
2002
ACM
110views Database» more  VLDB 2002»
13 years 7 months ago
Extending an ORDBMS: The StateMachine Module
Extensibility is one of the mayor benefits of object-relational database management systems. We have used this system property to implement a StateMachine Module inside an object-...
Wolfgang Mahnke, Christian Mathis, Hans-Peter Stei...
SIGMOD
2004
ACM
165views Database» more  SIGMOD 2004»
14 years 7 months ago
Industrial-Strength Schema Matching
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
Philip A. Bernstein, Sergey Melnik, Michalis Petro...