#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2015

2017

- This year (3)
- Last 5 years (4)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Stefano Calzavara, Ilya Grishchenko, Adrien Koutsos, Matteo Maffei
- 2017 IEEE 30th Computer Security Foundations…
- 2017

The present paper proposes the first static analysis for Android applications which is both flow-sensitive on the heap abstraction and provably sound with respect to a rich formal model of the Android platform. We formulate the analysis as a set of Horn clauses defining a sound over-approximation of the semantics of the Android application to analyse,… (More)

- Adrien Koutsos
- 2017

Exercise 1 (Cover time). Let G = (V,E) be a finite, undirected, and connected graph. A random walk on G is a Markov chain defined by the sequence of moves of a particle between vertices of G. In this process, the place of the particle at a given time step is the state of the system. If the particle is at vertex i and if i has d(i) outgoing edges, then the… (More)

- Adrien Koutsos, Victor Vianu
- J. Comput. Syst. Sci.
- 2015

Declarative, data-aware workflow models are becoming increasingly pervasive. While these have numerous benefits, classical process-centric specifications retain certain advantages. Workflow designers are used to development tools such as BPMN or UML diagrams, that focus on control flow. Views describing valid sequences of tasks are also useful to provide… (More)

- Hubert Comon-Lundh, Adrien Koutsos
- 2017 IEEE 30th Computer Security Foundations…
- 2017

We set up a framework for the formal proofs of RFID protocols in the computational model. We rely on the so-called computationally complete symbolic attacker model. Our contributions are: 1) to design (and prove sound) axioms reflecting the properties of hash functions (Collision-Resistance, PRF). 2) to formalize computational unlinkability in the model. 3)… (More)

- ‹
- 1
- ›