scispace - formally typeset
Search or ask a question
Institution

École normale supérieure de Cachan

EducationCachan, Île-de-France, France
About: École normale supérieure de Cachan is a education organization based out in Cachan, Île-de-France, France. It is known for research contribution in the topics: Decidability & Nonlinear system. The organization has 2717 authors who have published 5585 publications receiving 175925 citations.


Papers
More filters
Book ChapterDOI
15 Jun 2009
TL;DR: An epistemic logic is proposed for the applied pi calculus, which is a variant of the pi calculus with extensions for modeling cryptographic protocols, and which has constructs for reasoning about both intruder's epistemic knowledge and the set of messages in possession of the intruder.
Abstract: We propose an epistemic logic for the applied pi calculus, which is a variant of the pi calculus with extensions for modeling cryptographic protocols. In such a calculus, the security guarantees are usually stated as equivalences . While process calculi provide a natural means to describe the protocols themselves, epistemic logics are often better suited for expressing certain security properties such as secrecy and anonymity. We intend to bridge the gap between these two approaches: using the set of traces generated by a process as models, we define a logic which has constructs for reasoning about both intruder's epistemic knowledge and the set of messages in possession of the intruder. As an example we consider two formalizations of privacy in electronic voting and study the relationship between them.

50 citations

Journal ArticleDOI
TL;DR: In this paper, the effect of standard normal variate (SNV) normalization was evaluated in details (energy of laser, shot by shot, quantification) for in-situ depth analysis.

50 citations

Journal ArticleDOI
TL;DR: A statistical criterion based on the a contrario theory is described, which serves for both validation and model selection for a line segment and elliptical arc detector that produces a reduced number of false detections on various types of images without any parameter tuning.
Abstract: We propose a line segment and elliptical arc detector that produces a reduced number of false detections on various types of images without any parameter tuning. For a given region of pixels in a grey-scale image, the detector decides whether a line segment or an elliptical arc is present ( model validation ). If both interpretations are possible for the same region, the detector chooses the one that best explains the data ( model selection ). We describe a statistical criterion based on the a contrario theory, which serves for both validation and model selection. The experimental results highlight the performance of the proposed approach compared to state-of-the-art detectors, when applied on synthetic and real images.

50 citations

Journal ArticleDOI
TL;DR: The almost global practical stabilization of the eigenstates of the nonrelativistic charged particle in a one-dimensional infinite square potential well is proved by explicit feedback laws.
Abstract: We consider a nonrelativistic charged particle in a one-dimensional infinite square potential well. This quantum system is subjected to a control, which is a uniform (in space) time-depending electric field. It is represented by a complex probability amplitude solution of a Schrodinger equation on a one-dimensional bounded domain, with Dirichlet boundary conditions. We prove the almost global practical stabilization of the eigenstates by explicit feedback laws.

50 citations

Proceedings ArticleDOI
14 Sep 2008
TL;DR: This paper aims at computing the exact probability that a given timed automaton satisfies an omega-regular property, and develops a framework in which to compute a closed-form expression for this probability; it is proved that the threshold problem can be decided in that framework.
Abstract: In a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL properties has been investigated, where the aim is to check whether a given LTL property holds with probability 1 in a timed automaton, and solved for the class of single-clock timed automata. In this paper, we consider the quantitative model-checking problem for omega-regular properties: we aim at computing the exact probability that a given timed automaton satisfies an omega-regular property. We develop a framework in which we can compute a closed-form expression for this probability; we furthermore give an approximation algorithm,and finally prove that we can decide the threshold problem in that framework.

50 citations


Authors

Showing all 2722 results

NameH-indexPapersCitations
Shi Xue Dou122202874031
Olivier Hermine111102643779
John R. Reynolds10560750027
Shaul Mukamel95103040478
Tomás Torres8862528223
Ifor D. W. Samuel7460523151
Serge Abiteboul7327824576
Stéphane Roux6862719123
Zeger Debyser6740416531
Louis Nadjo6426412596
Praveen K. Thallapally6419012110
Andrew Travers6319313537
Shoji Takeuchi6369214704
Bineta Keita6327412053
Yves Mély6236813478
Network Information
Related Institutions (5)
École Polytechnique Fédérale de Lausanne
98.2K papers, 4.3M citations

92% related

École Normale Supérieure
99.4K papers, 3M citations

91% related

Georgia Institute of Technology
119K papers, 4.6M citations

91% related

University of Paris-Sud
52.7K papers, 2.1M citations

90% related

University of Paris
174.1K papers, 5M citations

90% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20233
202222
202121
202029
201958
201879