Searching for authors named "Constantinos Bartzis" – sorted by Relevance.
-
Widening arithmetic automata
- Abstract. Model checking of infinite state systems is undecidable, therefore, there are instances for which fixpoint computations used in infinite state model checkers do not converge. Given a widening operator one can compute an upper approximation of a least fixpoint in finite number of steps even
- Cited by 10 (1 self) – Add To MetaCart
-
Efficient symbolic representations for arithmetic constraints in verification
- In this paper we discuss efficient symbolic representations for infinite-state systems specified using linear arithmetic constraints. We give algorithms for constructing finite automata which represent integer sets that satisfy linear constraints. These automata can represent either signed or unsign
- Cited by 9 (3 self) – Add To MetaCart
-
Automata-based representations for arithmetic constraints in automated verification
- Abstract. In this paper we discuss efficient symbolic representations for infinite-state systems specified using linear arithmetic constraints. We give new algorithms for constructing finite automata which represent integer sets that satisfy linear constraints. These automata can represent either si
- Cited by 3 (1 self) – Add To MetaCart
-
Efficient BDDs for Bounded Arithmetic Constraints
- Symbolic model checkers use BDDs to represent arithmetic constraints over bounded integer variables. The size of such BDDs can be exponential in the number and size (in bits) of the integer variables in the worst case. In this paper we show how to construct linear-sized BDDs for linear integer arith
- Cited by 3 (1 self) – Add To MetaCart
-
Experimental evaluation of hot-potato routing algorithms on 2-dimensional processor arrays
- Abstract. In this paper we consider the problem of routing packets in two-dimensional torus-connected processor arrays. We describe the implementation of four hot-potato routing algorithms and study their performance by experimentation. The algorithms are either greedy in the sense that packets try
- Cited by 6 (0 self) – Add To MetaCart
-
Satisfiability checking of non-clausal formulas using general matings
- Abstract. Most state-of-the-art SAT solvers are based on DPLL search and require the input formula to be in clausal form (cnf). However, typical formulas that arise in practice are non-clausal. We present a new non-clausal SAT-solver based on General Matings instead of DPLL search. Our technique is
- Cited by 3 (1 self) – Add To MetaCart
-
Action language verifier, extended
- Action Language Verifier (ALV) is an infinite state model checker which specializes on systems specified with linear arithmetic constraints on integer variables. An Action Language specification consists of integer, boolean and enumerated variables, parameterized integer constants and a set of modul
- Cited by 6 (4 self) – Add To MetaCart
-
Ranking Attack Graphs
- Abstract. A majority of attacks on computer systems result from a combination of vulnerabilities exploited by an intruder to break into the system. An Attack Graph is a general formalism used to model security vulnerabilities of a system and all possible sequences of exploits which an intruder can u
- Cited by 4 (1 self) – Add To MetaCart

