Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Monniaux, David - Laboratoire VERIMAG, Centre National de la Recherche Scientifique (CNRS)
Abstracting Cryptographic Protocols with Tree Automata
Abstracting cryptographic protocols with tree David MONNIAUX
Abstraction of expectation functions using Gaussian distributions
CRYPTOGRAPHIQUES Stage de deuxi`eme annee de magist`ere d'informatique, realise au laboratoire
Abstract interpretation of probabilistic David Monniaux
Intended for submission to the 28th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming An Abstract Monte-Carlo Method for the Analysis of
Backwards Abstract Interpretation of Probabilistic Programs
An Abstract Analysis of the Probabilistic Termination of Programs
UNIVERSIT PARIS IX DAUPHINE UFR MATHMATIQUES DE LA DCISION
Analysis of Cryptographic Protocols using Logics of Belief: an Overview
Abstract interpretation of programs as Markov decision processes
Compositional analysis of floating-point linear numerical filters
The parallel implementation of the Astree static David Monniaux
Verification of Device Drivers and Intelligent Controllers: a David Monniaux
On using floating-point computations to help an exact linear arithmetic decision procedure
MMOIRE D'HABILITATION DIRIGER LES RECHERCHES Spcialit : informatique
Using Bounded Model Checking to Focus Fixpoint Iterations
Optimal abstraction on realvalued programs David Monniaux
A Quantifier Elimination Algorithm for Linear Real Arithmetic
RALISATION D'INTERPRTEURS
Verification of Device Drivers and Intelligent Controllers: a David Monniaux
Optimal abstraction on real-valued programs David Monniaux
Improving Strategies via SMT Solving Thomas Martin Gawlitza David Monniaux
Quantifier elimination by lazy model enumeration David Monniaux
On the Generation of Positivstellensatz Witnesses in Degenerate Cases
Abstract interpretation of programs as Markov decision processes
Decision Procedures for the Analysis of Cryptographic Protocols by Logics of Belief
Automatic Modular Abstractions for Linear Constraints David Monniaux
A minimalistic look at widening operators David Monniaux
Automatic Modular Abstractions for Template Numerical Constraints
Stratified Static Analysis Based on Variable Dependencies
Modular Abstractions of Reactive Nodes using Disjunctive Invariants
