4962 search results - page 784 / 993 » Stochastic Model Checking |
107
Voted
CAV
2008
Springer
15 years 4 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...
104
Voted
CSCWD
2005
Springer
15 years 4 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 ...
134
click to vote
ESOP
2008
Springer
15 years 4 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...
113
Voted
FM
2008
Springer
15 years 3 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...
99
Voted
DLT
2008
15 years 3 months ago
2008
We consider multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-emp...