23 search results - page 2 / 5 » Programs with Lists Are Counter Automata |
ENTCS
2006
13 years 5 months ago
2006
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...
NFM
2011
13 years 12 days ago
2011
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...
POPL
2009
ACM
14 years 6 months ago
2009
ACM
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...
CAV
2009
Springer
14 years 6 months ago
2009
Springer
We provide a verification technique for a class of programs working on integer arrays of finite, but not a priori bounded length. We use the logic of integer arrays SIL [13] to spe...
IV
2007
IEEE
13 years 11 months ago
2007
IEEE
We propose a method for generating all possible rules of multidimension Boolean cellular automata (CA). Based on an original encoding method and the programming of graphical proce...