Sciweavers

2214 search results - page 301 / 443
» Complexity of Reasoning
Sort
View
LICS
2009
IEEE
16 years 1 months ago
An Improved Lower Bound for the Complementation of Rabin Automata
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
Yang Cai, Ting Zhang, Haifeng Luo
TPHOL
2009
IEEE
16 years 1 months ago
Practical Tactics for Separation Logic
Abstract. We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics enable the verification of partial correctne...
Andrew McCreight
ADBIS
2009
Springer
143views Database» more  ADBIS 2009»
16 years 29 days ago
Cost-Based Vectorization of Instance-Based Integration Processes
The inefficiency of integration processes—as an abstraction of workflow-based integration tasks—is often reasoned by low resource utilization and significant waiting times f...
Matthias Böhm, Dirk Habich, Steffen Preissler...
ATAL
2009
Springer
16 years 28 days ago
Combining fault injection and model checking to verify fault tolerance in multi-agent systems
The ability to guarantee that a system will continue to operate correctly under degraded conditions is key to the success of adopting multi-agent systems (MAS) as a paradigm for d...
Jonathan Ezekiel, Alessio Lomuscio
ATAL
2009
Springer
16 years 28 days ago
Decommitting in multi-agent execution in non-deterministic environment: experimental approach
The process of planning in complex, multi-actor environment depends strongly on the ability of the individual actors to perform intelligent decommitment upon specific changes in ...
Jirí Vokrínek, Antonín Komend...