Sciweavers

1454 search results - page 113 / 291
» Stateful traits and their formalization
Sort
View
SAS
1997
Springer
162views Formal Methods» more  SAS 1997»
15 years 4 months ago
Exact Flow Analysis
We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis ...
Christian Mossin
104
Voted
WDAG
1993
Springer
98views Algorithms» more  WDAG 1993»
15 years 4 months ago
Fairness of N-party Synchronization and Its Implementation in a Distributed Environment
Fairness is an important concept in design and implementation of distributed systems. At the specification level, fairness usually serves as an assumption for proving liveness. At ...
Cheng Wu, Gregor von Bochmann, Ming Yu Yao
105
Voted
ARGMAS
2007
Springer
15 years 4 months ago
On the Benefits of Exploiting Hierarchical Goals in Bilateral Automated Negotiation
Interest-based negotiation (IBN) is a form of negotiation in which agents exchange information about their underlying goals, with a view to improving the likelihood and quality of ...
Iyad Rahwan, Philippe Pasquier, Liz Sonenberg, Fra...
97
Voted
FMCAD
2004
Springer
15 years 4 months ago
A Partitioning Methodology for BDD-Based Verification
The main challenge in BDD-based verification is dealing with the memory explosion problem during reachability analysis. In this paper we advocate a methodology to handle this probl...
Debashis Sahoo, Subramanian K. Iyer, Jawahar Jain,...
101
Voted
CP
2006
Springer
15 years 4 months ago
: A Bottom-Up Approach for Solving Quantified CSPs
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
Guillaume Verger, Christian Bessière