Wolper, Pierre - Institut Montefiore, Université de Liège

• The Algorithmic Verification of
• Chapitre II Le mod`ele relationnel et
• Chapitre VIII Les bases de donnees
• Uncomputability 7.1 Introduction
• Temporal Logics and Automata
• An AutomataTheoretic Approach to BranchingTime Model Checking
• Infinite Structures in Databases and
• La cooperation entre processus Motivation
• A Representation Framework for Verifying Systems with
• La memoire virtuelle Gerer la memoire d'un processus
• Iterating Transducers in the Large (extended abstract)
• Handling Real Arithmetic with Infinite Word Automata
• Bases de donnees Pierre Wolper
• Chapitre IV Les bases de donnees relationnelles
• Chapitre VII Les bases de donnees deductives
• Comment programmer ULg01 ? 1. Comment eviter d'ecrire des "bits" gr^ace `a un langage d'assemblage.
• La memoire virtuelle Gerer la memoire d'un processus
• La cooperation entre processus Des processus actifs simultanement sont dits executes en parall`ele. Ils
• Une realisation de la machine orientee vers les performances
• La technique du "pipeline" et la machine
• Modles du paralllisme et Processeurs modernes
• Regular grammars 3.1 Introduction
• Pushdown automata and context-free languages
• Cours de "Projet de programmation orientee-objet"
• Cours de "Projet de programmation orientee-objet"
• Structure des ordinateurs Pierre Wolper
• Representing Arithmetic Constraints with Finite
• On the Representation of Infinite Temporal Data and Queries \Lambda (Extended Abstract)
• An Introduction to Model Checking
• Reliable Hashing without Collision Detection ? Pierre Wolper and Denis Leroy
• Recursive functions 6.1 Introduction
• Introduction to computability Pierre Wolper
• Relative Liveness and Behavior Abstraction (Extended Abstract)
• On the Expressiveness of Real and Integer Arithmetic Automata
• 8.1 Introduction Solvable problems versus efficiently solvable problems.
• The Algorithmic Verification of
• Les m'ethodes ordrepartiel en v'erification de mod`eles
• Algorithms for Synthesizing
• Handling Infinite Temporal Data \Lambday F. Kabanza JM. Stevenne P. Wolper
• On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real
• International Journal on Software Tools for Technology Transfer ManuscriptNr. (will be inserted by hand later)
• A Partial Approach to Model Checking \Lambda Patrice Godefroid Pierre Wolper
• "Projet de programmation orientee-objet"
• Dynamics and Verification Where is the Link ?
• An Algorithmic Approach for Checking Closure Properties of !Regular Languages
• Using and Avoiding Temporal Logic
• The Algorithmic Verification of
• Moniteurs, Java, Threads et Une vue orientee-objet
• Cours de "Projet de programmation orientee-objet"
• Les bases de donnees relationnelles en pratique
• Exploring Infinite State Spaces with Finite Automata
• Bases de donnees Pierre Wolper
• Handling Real Arithmetic with Infinite Word Automata
• PartialOrder Methods for Model Checking: From Linear Time to Branching Time
• A Direct Symbolic Approach to Model Checking Pushdown Systems
• The Algorithmic Verification of
• Handling Constraints in Temporal Databases
• Chapitre VI L'implementation du mod`ele
• The Algorithmic Verification of
• PartialOrder Methods for Temporal Verification ?
• Turing Machines 5.1 Introduction
• Cours de "Structure des ordinateurs" Annee academique 2010-2011 -Travail pratique 2
• Chapitre IX L'integration de donnees
• Cours de "Projet de programmation orientee-objet"
• Propositions de sujets sur le projet Ramss (description du projet : http://www.egypto.ulg.ac.be/Ramses.htm,
• Verifying Systems with Infinite but Regular State Spaces
• The Algorithmic Verification of
• Proposition de Travail de fin d'tudes 20082009 Arlenda est une Spinoff de l'Universit de Lige dont la mission est de proposer une srie de
• La gestion des transactions La gestion des transactions
• Constructing Automata from Temporal Logic Formulas
• The Algorithmic Veri cation of
• Verifying Systems Infinite but Regular
• The Algorithmic Verification of
• Cours de "Projet de programmation orientee-objet"
• ConstraintGenerating Dependencies ? Marianne Baudinet, 1 Jan Chomicki, 2 and Pierre Wolper 3
• Simple Onthefly Automatic Verification of Linear Temporal Logic
• Finite Automata 2.1 Introduction
• The Algorithmic Verification of
• Chapitre II Le mod`ele relationnel et
• An Introduction to Model Checking
• The Algorithmic Verification of
• Les semaphores et leur implementation
• Chapitre III La theorie des dependances et la
• Le probl`eme des Philosophes
• MemoryEfficient Algorithms for the Verification of Temporal Properties \Lambda
• The Algorithmic Veri cation of
• Where could SPIN go next? A unifying approach to
• Le probl`eme des lecteurs et redacteurs
• Vers un syst`eme d'exploitation : Les processus et leur gestion
• Computation structures Pierre Wolper
• How can the machine ULg01 be programmed?
• A performance-oriented implementation of the
• Monitors, Java, Threads and An object-oriented view of
• Towards an operating system: Processes and their
• The "pipeline" technique and the machine
• Interaction and cooperation among processes
• The Dining Philosophers Cache Memory
• Virtual memory Managing the memory used by a process
• Semaphores and their implementation
• Interaction and cooperation among processes
• The readers-writers problem Communication through
• Concurrency models and Modern Processors