3909 search results - page 558 / 782 » Extreme Model Checking |
175
click to vote
BIRTHDAY
2008
Springer
15 years 8 months ago
2008
Springer
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...
154
click to vote
CAV
2008
Springer
15 years 8 months ago
2008
Springer
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...
163
click to vote
CSCWD
2005
Springer
15 years 8 months ago
2005
Springer
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 ...
185
click to vote
ESOP
2008
Springer
15 years 8 months ago
2008
Springer
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...
162
click to vote
FM
2008
Springer
15 years 8 months ago
2008
Springer
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...