Sciweavers

3224 search results - page 508 / 645
» On Checking Model Checkers
Sort
View
ECOOP
2010
Springer
14 years 5 days ago
Adding Dynamic Types to C#
Developers using statically typed languages such as C and Java are increasingly having to interoperate with APIs and object models defined in dynamic languages. This impedance mis...
Gavin M. Bierman, Erik Meijer, Mads Torgersen
BIRTHDAY
2008
Springer
14 years 4 days ago
History Dependent Automata for Service Compatibility
We use History Dependent Automata (HD-automata) as a syntax-indepentend formalism to check compatibility of services at binding time in Service-Oriented Computing. Informally speak...
Vincenzo Ciancia, Gian Luigi Ferrari, Marco Pistor...
CAV
2008
Springer
130views Hardware» more  CAV 2008»
14 years 4 days ago
A Hybrid Type System for Lock-Freedom of Mobile Processes
We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...
Naoki Kobayashi, Davide Sangiorgi
CSCWD
2005
Springer
14 years 3 days ago
Process mining in CSCW systems
Process mining techniques allow for extracting information from event logs. For example, the audit trails of a workflow management system or the transaction logs of an enterprise ...
Wil M. P. van der Aalst
ESOP
2008
Springer
13 years 12 months ago
Cover Algorithms and Their Combination
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
Sumit Gulwani, Madan Musuvathi