Sciweavers

219 search results - page 24 / 44
» Context-aware counter abstraction
Sort
View
EVOW
2006
Springer
15 years 3 months ago
BeeHiveGuard: A Step Towards Secure Nature Inspired Routing Algorithms
Abstract. Nature inspired routing protocols for fixed and mobile networks are becoming an active area of research. However, analyzing their security threats and countering them hav...
Horst Wedde, Constantin Timm, Muddassar Farooq
ENTCS
2006
123views more  ENTCS 2006»
14 years 11 months ago
From Discrete Duration Calculus to Symbolic Automata
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
Laure Gonnord, Nicolas Halbwachs, Pascal Raymond
CLEIEJ
2006
120views more  CLEIEJ 2006»
14 years 12 months ago
A semantics for while with break, continue and goto
This work presents a formal description of a subset of a C-like language in the form of an operational semantics. We give semantics to the following statements (presented in alpha...
Patricia Peratto
NFM
2011
223views Formal Methods» more  NFM 2011»
14 years 6 months ago
opaal: A Lattice Model Checker
Abstract. We present a new open source model checker, opaal, for automatic verification of models using lattice automata. Lattice automata allow the users to incorporate abstracti...
Andreas Engelbredt Dalsgaard, René Rydhof H...
POPL
2009
ACM
16 years 13 days 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...