2878 search results - page 326 / 576 » Model Checking FTA |
111
click to vote
ATAL
2008
Springer
15 years 7 months ago
2008
Springer
We present a proof-technique for reducing the nondeterminbstract agent specifications in a BDI framework by means of refinement. We implement the operational semantics of agent sp...
159
click to vote
FORTE
2004
15 years 6 months ago
2004
Numerous specialized ad hoc routing protocols are currently proposed for use, or being implemented. Few of them have been subjected to formal verification. This paper evaluates two...
127
Voted
COLING
1992
15 years 6 months ago
1992
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...
139
click to vote
JUCS
2006
15 years 5 months ago
2006
: The size and complexity of software systems are continuously increasing, which makes them difficult and labor-intensive to develop, test and evolve. Since concurrent systems are ...
135
click to vote
CAV
2010
Springer
15 years 9 months ago
2010
Springer
Well-defined memory consistency models are necessary for writing correct parallel software. Developing and understanding formal specifications of hardware memory models is a chal...