Sciweavers

2873 search results - page 437 / 575
» Model Checking and the Mu-calculus
Sort
View
AAAI
2007
13 years 10 months ago
Logic for Automated Mechanism Design - A Progress Report
Over the past half decade, we have been exploring the use of logic in the specification and analysis of computational economic mechanisms. We believe that this approach has the p...
Michael Wooldridge, Thomas Ågotnes, Paul E. ...
ECOOP
2010
Springer
13 years 10 months 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
13 years 10 months 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»
13 years 10 months 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
13 years 10 months 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