Sciweavers

714 search results - page 82 / 143
» Formal Verification of Cognitive Models
Sort
View
ENTCS
2006
173views more  ENTCS 2006»
15 years 1 months ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal
ATAL
2006
Springer
15 years 5 months ago
Model checking knowledge, strategies, and games in multi-agent systems
We present an OBDD-based methodology for verifying time, knowledge, and strategies in multi-agent systems specified by the formalism of interpreted systems. To this end, we invest...
Alessio Lomuscio, Franco Raimondi
121
Voted
TAICPART
2006
IEEE
170views Education» more  TAICPART 2006»
15 years 8 months ago
Generation of Conformance Test Suites for Compositions of Web Services Using Model Checking
Testing compositions of web services is complex, due to their distributed nature and asynchronous behaviour. However, research in this field is scarce. We propose a new testing me...
José García-Fanjul, Claudio de la Ri...
99
Voted
TCS
2008
15 years 1 months ago
Sound and complete computational interpretation of symbolic hashes in the standard model
This paper provides one more step towards bridging the gap between the formal and computational approaches to the verification of cryptographic protocols. We extend the well-known ...
Flavio D. Garcia, Peter van Rossum
145
Voted
CAV
2009
Springer
209views Hardware» more  CAV 2009»
16 years 2 months ago
Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamari...