229 search results - page 9 / 46 » Bilateral Algorithms for Symbolic Abstraction |
ESOP
1994
Springer
13 years 11 months ago
1994
Springer
Abstract. We convert, via a version that uses constraints, a type inference system for strictness analysis into an algorithm which given an expression finds the set of possible typ...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A lexicographic ranking function for the set of all permutations of n ordered symbols translates permutations to their ranks in the lexicographic order of all permutation...
CIA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We adopt the Markov chain framework to model bilateral negotiations among agents in dynamic environments and use Bayesian learning to enable them to learn an optimal stra...
FM
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Predictive analysis aims at detecting concurrency errors during runtime by monitoring a concrete execution trace of a concurrent program. In recent years, various models ...
ATVA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The saturation state-space generation algorithm has demonstrated clear improvements over state-of-the-art symbolic methods for asynchronous systems. This work is motivate...