Sciweavers

453 search results - page 35 / 91
» Using Symbolic Simulation for Bounded Property Checking
Sort
View
POPL
2009
ACM
14 years 9 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
FOSAD
2009
Springer
14 years 3 months ago
The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols
We introduce the Open-source Fixed-point Model Checker OFMC for symbolic security protocol analysis, which extends the Onthe-fly Model Checker (the previous OFMC). The native inpu...
Sebastian Mödersheim, Luca Viganò
ADVCS
2010
106views more  ADVCS 2010»
13 years 8 months ago
'What did You Say?' Emergent Communication in a Multi-Agent Spatial Configuration
This paper reports the results of a multi-agent simulation designed to study the emergence and evolution of symbolic communication. The novelty of this model is that it considers s...
Elio Marchione, Mauricio Salgado, Nigel Gilbert
SPIN
2007
Springer
14 years 2 months ago
Tutorial: Parallel Model Checking
d Abstract) Luboˇs Brim and Jiˇr´ı Barnat Faculty of Informatics, Masaryk University, Brno, Czech Republic With the increase in the complexity of computer systems, it becomes e...
Lubos Brim, Jiri Barnat
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 8 months ago
The Secrecy Graph and Some of its Properties
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
Martin Haenggi