Sciweavers

4340 search results - page 439 / 868
» Formal Methods and Cryptography
Sort
View
SIMUTOOLS
2008
15 years 8 months ago
Transforming sources to petri nets: a way to analyze execution of parallel programs
Model checking is a suitable formal technique to analyze parallel programs' execution in an industrial context because automated tools can be designed and operated with very ...
Jean-Baptiste Voron, Fabrice Kordon
ATAL
2010
Springer
15 years 8 months ago
CTL.STIT: enhancing ATL to express important multi-agent system verification properties
We present the logic CTL.STIT, which is the join of the logic CTL with a multi-agent strategic stit-logic variant. CTL.STIT subsumes ATL, and adds expressivity to it that we claim...
Jan Broersen
CEC
2010
IEEE
15 years 8 months ago
Geometric Nelder-Mead Algorithm for the permutation representation
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
Alberto Moraglio, Julian Togelius
APAL
2010
141views more  APAL 2010»
15 years 7 months ago
Locatedness and overt sublocales
Locatedness is one of the fundamental notions in constructive mathematics. The existence of a positivity predicate on a locale, i.e. the locale being overt, or open, has proved to ...
Bas Spitters
FAC
2008
100views more  FAC 2008»
15 years 6 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois