Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
Speakers on PAM
[go: Go Back, main page]
CWI  
  =-

Speakers on PAM
Name: Talk:
Luca Aceto (email), Reykjavik University Iceland, Aalborg University Denmark (BRICS)
  1. The Role of Hennessy's Merge in the Quest for Finite Equational Axiomatizations of Parallel Composition Modulo Bisimilarity
Jagannath Aghav (email)
  1. Unifying Time Constraints Validation
Suzana Andova (email), UT
  1. Discrete Time Process Algebra with relative timing
  2. Probabilistic process algebra with discrete timing.
Farhad Arbab (email), CWI
  1. The Coordination Language Manifold.
  2. Back To The Future: A Family of Algorithms for Termination
    Detection in Distributed Systems.
Thomas Arts (email), Ericsson
  1. Case studies within Ericsson Telecom on the use of formal verification.
  2. Verification of distributed locker algorithms.
  3. Formal verification of software
Bahareh Badban (email), CWI
  1. Propositional logic with equality and uninterpreted functions
  2. Extension of the DPLL method for theorem proving in free algebras
  3. An extension of DPLL procedure
  4. Verifying a Sliding Window Protocol with Piggybacking in muCRL
Jos Baeten (email), TU/e
  1. Termination in real time process algebra
  2. A new basis for process algebra.
  3. Abstraction in probabilistic process algebra.
  4. Axiomatizing GSOS with termination.
  5. Process algebra with pointers
  6. A generic process algebra, with application to a ground-complete axiomatization of finite-state processes
  7. Regular Expressions under Bisimulation
Christel Baier (email), Univ. of Bonn
  1. Branching Time Relations for Markov Chains
  2. Semantics and Verification of a probabilistic guarded command language
Alexandru Baltag (email), CWI
  1. Rationality in Games with Mixed Strategies.
Falk Bartels (email), CWI
  1. Probabilistic GSOS
Gilles Barthe (email), CWI
  1. Algebraic type systems.
Bert van Beek (email), TU/e
  1. Modelling, Simulation and Verification of Hybrid Systems using Chi
Harm van Beek ( H.M.A.v.Beek@tue.nl">email), TU/e
  1. An Algebraic Approach to Transactional Processes
  2. Automatic Conformance Testing of Internet Applications
Jan Bergstra (email), UvA
  1. Discrete Time Process Algebra
  2. Program Algebra
  3. The expression of recursion, multithreading and mobility in Program Algebra.
  4. Compilers, Interpreters and the Halting Problem.
  5. Molecular dynamics.
  6. Polarized process algebra.
  7. Decidability issues in program algebra
  8. Algebraic Specifications for Fields and Meadows
Inge Bethke (email), UvA
  1. Molecular Dynamics
Stefan Blom (email), CWI
  1. Translating IDEAL to mCRL.
  2. Efficient state space generation using partial tau-confluence.
  3. Bisimulation reduction by using two different algorithms
  4. On the distributed tools in the µCRL toolset
  5. Lifting infinite normal form definitions from term rewriting to term graph rewriting
  6. Signature Refinement Bisimulations I
  7. Signature Refinement Bisimulations II: distributed implementation.
  8. Infinitary Rewriting
Roel Bloo (email), TU/e
  1. Two formal semantics and their equivalence
Egon Boerger (email), Univ. of Pisa
  1. A comparative analysis of Java and C#
Victor Bos (email), TU/e
  1. Formal Operational Semantics of Chi
  2. Formalisation of Chi.
Dragan Boshnachki (email), TU/e
  1. Reconciling Partial Order Reduction and Weak Process Fairness
Julian Bradfield (email), Univ. of Edinburgh
  1. Independence and concurrency
Lubos Brim (email), ParaDiSe, Brno, Czech Republic
  1. Distributed-Memory LTL Model-Checking
Jens Calame (email), CWI
  1. Abstraction and Concretization for Test Generation -- The Whole Story
  2. Data Abstraction and Constraint-Solving for Conformance Testing
  3. Towards Modularization of the mCRL Library
Jan Cederquist (email), CWI
  1. A formal verification of cryptographic algorithms
Michel Chaudron (email), TU/e
  1. A coordination based design method.
Taolue Chen (email), CWI
  1. Weak Bisimulation Congruences for the Chi-Calculus
  2. On the Axiomatizability of Priority
Dmitri Chkliaev (email), CWI
  1. Verification and Improvement of the Sliding Window Protocol
Rance Cleaveland (email), Stony Brook
  1. Crossing Boundaries, Compositionally
Cas Cremers (email), TU/e
  1. Defining Authentication in a Trace Model
  2. Multi-Protocol Attacks : An academic problem?
Pedro D'Argenio (email), Uni. Cordoba
  1. Stochastic Process Algebras and Discrete Event Simulation.
  2. Reachability Analysis of Probabilistic Systems by Successive Refinements
  3. Secure Information Flow by Self-Composition
Dennis Dams (email), Bell Labs
  1. Verifications of the USB protocol.
  2. Abstraction-based Analysis of a Simple Medium Access Control Protocol
  3. An Overview of Software Development Tools at Bell Labs Research
Muhammad Dashti (email), CWI
  1. A model of intruder for verifying liveness properties
  2. Adapting Beam Search for Partial Order Reduction in Security Protocols
Conrado Daws (email), UT
  1. Automatic Verification of Soft Deadlines with KRONOS and PRISM
  2. Symbolic and Parametric Model Checking of Discrete-Time Markov Chains
Erik de Vink (email), TU/e
  1. A Formalization of Anonymity and Onion Routing
Bob Diertens (email), UvA
  1. Generation of animations for simulation of process algebra specifications.
Hugo Elbers (email), CWI
  1. Proof checking using certified algorithms.
Harald Fecher (email), Universität Mannheim
  1. Event structures for interrupt process algebras
Wan Fokkink (email), CWI
  1. Language Equivalence as a Congruence
  2. Within ARM's Reach: Compilation of Rewrite Systems
  3. Lazy Rewriting on Eager Machinery
  4. All you wanted to know about testing but did not dare to ask
  5. Modalities => Congruence Formats
  6. Which Algebras have Finite Equational Axiomatizations?
  7. Interleaving with Handshaking Communication has no Finite Equational Basis
  8. Refinement and Verification Applied to an In-Flight Data Acquisition Unit
  9. Verification of a Sliding Window Protocol
  10. On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds
  11. Is Timed Branching Bisimilarity an Equivalence Indeed?
Murdoch J. Gabbay (email), King's College London
  1. Nominal Terms and (Extended) Nominal Rewriting
Hubert Garavel (email), INRIA
  1. Almost Ten Years of Process Algebras and Model Checking for Multiprocessor Architectures
Rob van Glabbeek (email), Stanford Uni.
  1. Full Abstraction in Structural Operational Semantics
  2. ST-configuration structures as an abstraction of Petri nets under the collective token interpretation
  3. Proof nets for unit-free multiplicative-additive linear logic
  4. An interpolation theorem in equational logic
  5. Cool Congruence Formats for Weak Bisimulations
Henk Goeman (email), CWI
  1. Towards a Theory of (Self) Applicative Communicating Processes.
Nicu Goga (email), TU/e
  1. Comparing TorX, Autolink, TGV and UIO Test Algorithms
  2. A Distributed Spanning Tree Algorithm for Topology-Aware Networks
Clemens Grabmayer (email), VU
  1. Proving Equality for Recursive Types - A Duality between `syntactic-matching' tableaux and Brandt-Henglein derivations
David Griffioen (email), CWI
  1. Formalisatie van IO-automaten theorie in PVS.
  2. On IEEE 1394 and More.
  3. Normed Simulations
Jan Friso Groote (email), TU/e
  1. Deadlock detection
  2. Timed µCRL
  3. Binary Decision Diagrams vs. Resolution
  4. The mCRL lineariser.
  5. Proving $\omega$-completeness using inverted substitutions.
  6. Tau Confluence
  7. Local tau-confluence.
  8. A correctness proof of the sliding window protocol.
  9. Task allocation in a multi server system
    • A proposal for GenSpect, a language to unite colored Petri Nets and process algebra with data.
    • A proposal for concrete datatypes in mCRL.
  11. Parameterised Boolean Equation Systems.
Frank van Ham (email), TU/e
  1. Interactive Visualization of State Transition Systems
Jerry den Hartog (email), TU/e
  1. PINPAS: a tool for power analysis of smartcards
Prashant Hegde (email), CWI
  1. Origin Tracking in the mCRL Toolset
Marco Hollenberg (email), CWI
  1. Operational semantics for EURIS.
Rob Hoogerwoord (email), TU/e
  1. Systematic Protocol Design
  2. Programming by Calculation
Jozef Hooman (email), KUN
  1. Verification of concurrency control protocols with PVS
  2. The equivalence of an operational and a denotational semantics of Splice
Anna Ingolfsdottir (email)
  1. On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers
Natalia Ioustinova (email), CWI
  1. Closing open SDL-systems for model checking with DTSpin
  2. Timed verification with µCRL
  3. Using Fairness to Make Abstractions Work
Joost-Pieter Katoen (email), UT
  1. Automated Compositional Markov Chain Generation for a Plain-Old Telephone System.
Misa Keinanen (email), HUT / DCSE / TCS
  1. Solving disjunctive/conjunctive boolean equation systems with alternating fixed points.
Jeroen Kleijn (email), TU/e
  1. A Process Algebra Based Verification of a Production System
Stephan Kleuker (email)
  1. Incremental Development of Deadlock-Free Communicating Systems.
Jan Willem Klop (email), VU
  1. Looking Back
  2. Origin tracking in the lambda calculus
  3. Iterative Path Orders.
  4. Infinitary Normalization
  5. ORDINAL ARITHMETIC VIA INFINITARY TERM REWRITING.
Roman V. Konchakov and Konstantin O. Savenkov (email)
  1. MM model description language. Syntax and semantics.
    Translation from MM to muCRL specifications.
Tomas Krilavicius (email), Univ. Twente
  1. Behavioural Hybrid Process Calculus
Ralf Laemmel (email), CWI
  1. Reflective SOS and friends
Frederic Lang (email), VASY, INRIA Rhône-Alpes
  1. Exp.Open 2.0: A Flexible Tool Integrating Partial Order, Compositional, and On-the-fly Verification Methods
Izak van Langevelde (email), CWI
  1. Optimizing TCAP -- a case study in protocol analysis
  2. Swapping bisimulations
  3. Slicing up SPLICE.
  4. SVC: a compact file format for labelled transition systems.
  5. On Buses and Bridges
  6. Symmetry in labeled transition systems
  7. Founding FireWire bridges through Promela Prototyping.
Alexander Letichevsky (email)
  1. Interaction of agents and environments
Martin Leucker (email), Uni. Aachen
  1. Distributed Model Checking
Bert Lisser (email), CWI
  1. HeerHugo
  2. Reducing state spaces by symbolic reasoning about linear
    process equations.
  3. Bisimulation reduction by using two different algorithms
  4. Architecture of the µCRL Toolset with Emphasis on the Simulator
Bas Luttik (email), TU/e
  1. µCRL tools in ASF+SDF.
  2. Alternative quantification in process algebras with data
  3. IEEE 1394 Link Layer.
  4. Branching bisimulation & process algebras with data.
  5. Cylindric Process Algebras.
  6. Interleaving.
  7. On unique factorisation of communicating processes.
  8. On the relationship between muCRL and ACP
  9. Unique decomposition in certain partially ordered monoids
  10. Decomposition Orders
  11. Towards a finite basis for CCS
Martin Mach (email), VU
  1. Behavior Protocols for Software Components
Rashindra Manniesing (email), CWI
  1. Impossibility of consensus for fully asynchronous
    distributed systems.
Radu Mateescu (email), CWI
  1. Value-based verification of LOTOS programs
  2. Verification of Temporal Properties of Processes in a Setting with Data
Aad Mathijssen (email), TU/e
  1. GenSpect, a specification language for Petri Nets and process algebra
  2. One-and-a-halfth-order logic
Sjouke Mauw (email), TU/e
  1. A hierarchy of communication models for Message Sequence Charts.
  2. Experiences from the CHAMPS project.
  3. MSC and data.
  4. Why men (and octopuses) cannot juggle a four ball cascade.
  5. An algorithm for the asynchronous Write-All problem based on process collision.
  6. Specifying Internet applications with DiCons.
  7. An MSC based representation of DiCons.
  8. Operational semantics of security protocols I
  9. Authentication through synchronization
  10. Model checking secrecy
  11. A Syntactic Criterion for Injectivity of Authentication Protocols
Kees Middelburg (email), TU/e
  1. Truth of Duration Calculus Formulae in Timed Frames
  2. Variable Binding Operators in Transition System Specifications.
  3. A new equivalence for processes with timing (with an application to protocol verification)
  4. Simulating Turing Machines Using Thread Algebra
François Monin (email), TU/e
  1. A formal algebraic verification of a distributed system
Martijn Monteban (email), VU
  1. Reduction algorithms on linear process equations
Arjan Mooij (email), TU/e
  1. Tool support for the design of provably-correct parallel programs
Mohammad Mousavi (email), Tu/E
  1. (Nominal) SOS
Sumit Nain (email), CWI
  1. Complete and Omega Complete Axiomatizations of Process Equivalences
  2. Covers - A Simpler View of Process Equations.
Nikolaj (Mykola) Nikitchenko (email)
  1. COMPOSITION NOMINATIVE SYSTEMS AND THEIR APPLICATION IN PROGRAMMING, LOGIC AND TRANSPORT MODELING
Hitoshi Ohsaki (email), AIST
  1. Automated verification of network protocols based on AC-tree automata theory.
Ernst-Rüdiger Olderog (email)
  1. Development of Correct Real-Time Systems.
  2. Combining Specification Techniques for Processes, Data and Time.
Martijn Oostdijk (email), TU/e
  1. How to prove Prime(1234567891) in Coq
Simona Orzan (email), CWI
  1. Distributing LPEs on Basic Splice.
  2. Distributed bisimulation reduction
  3. Distributed strong bisimulation reduction - revisited
  4. Detecting strongly connected components in very large distributed statespaces
Michiel van Osch (email), TU/e
  1. A specification of EURIS in muCRL.
Jun Pang (email), CWI
  1. A Balancing Act: Analyzing a Distributed Lift System.
  2. Analysis of the Needham-Schroeder Public-key Protocol in mCRL
  3. Model Checking a Cache Coherence Protocol for a Java Distributed Shared Memory Implementation
  4. Cones and foci for protocol verification revisited
  5. Distributed algorithms for self-stabilization, leader election and their verification.
Bas Ploeger (email), TU/e
  1. Analysis of Embedded Copier Software
Jaco van de Pol (email), CWI
  1. Process algebra in Isabelle/HOL
  2. Formal Requirements Specification I: basics & case study
  3. Automatic Test Generation for MPEG Audio
  4. BDDs with equalities.
  5. Expressiveness of Basic Splice
  6. A Prover in the muCRL toolset.
  7. Just-in-time: on Strategy Annotations.
  8. Replication on Splice in muCRL and PVS
  9. Confluence for on-the-fly and symbolic state space reduction
  10. BDDs for quantifier free logics with equality
  11. New Confluence Notions
  12. Fixpoint Equation Systems
Alban Ponse (email), UvA
  1. Process Algebra with Early Inputs and Recursive Operations
  2. Process Algebra with Some Many-Valued Logics
  3. Two Recursive Generalizations of Iteration in Process Algebra.
  4. Register machine based processes
  5. To be announced.
  6. Program Algebra
  7. Execution Architectures for Program Algebra and ACP's logic
  8. Decision Problems for Pushdown Threads
Gaganpreet Luthra and Pooja Mittal (email), CWI
  1. Exploring The Statespace World.
Wishnu Prasetya (email), UU
  1. UNITY Logic
Hannes Pretorius (email), TU/e
  1. Visual Analysis of Transition Systems
Julian Rathke (email)
  1. A theory of bisimulation for a fragment of CML with local names.
Michel Reniers (email), TU/e
  1. Abstraction in relative discrete time process algebra.
  2. Discrete Time Process Algebra with Empty Process.
  3. The empty process and timed muCRL.
Arend Rensink (email)
  1. A C.P.O. for Bisimulation.
Piet Rodenburg (email), UvA
  1. A modernization of process algebra.
  2. A structural introduction to process algebra.
  3. Specification of partial operations
  4. On a formalization of the concept of propositional function in Principia Mathematica.
Michael Rohrbach (email), RWTH Aachen
  1. Model Checking Embedded Systems Software
Judi Romijn (email), TU/e
  1. Exploiting Symmetry in Protocol Testing
  2. Modelchecking a HAVi leader election protocol
  3. Philips project.
  4. Model checking of (priced/parametric) timed automata.
Bill Rounds (email), Univ. of Michigan
  1. The Phi-calculus - a new language for distributed control of continuous reconfigurable systems
Vlad Rusu (email), Irisa/Inria
  1. Combining formal verification and conformance testing for reactive systems
Jan Rutten (email), CWI
  1. Automata and coinduction: an exercise in coalgebra
  2. Elements of Stream Calculus and its Applications.
Dusko S. Jovanovic (email), Univ. of Twente
  1. Designing dependable process-oriented software, a CSP approach
Jan van Schuppen (email), CWI
  1. Modeling and Control of Hybrid Systems
Alexander Serebrenik (email), TU/e
  1. Termination analysis for (constraints) logic programs.
Wendelin Serwe (email), VASY, INRIA-Rhône-Alpes
  1. State Space Reduction for Process Algebra Specifications
Carron E. Shankland (email), UvA
  1. Building a framework to reason symbolically about Full LOTOS.
Natalia Sidorova (email), TU/e
  1. Generalised Soundness for Workflow Nets
Jan Springintveld (email), CWI
  1. Testing Timed Automata.
  2. Model checking business processes.
Marielle Stoelinga (email), KUN
  1. Testing scenario's for probabilistic automata
  2. From Quality to Quantity: Quantative Logics and System relations for transition systems.
Volker Stolz (email), RWTH Aachen
  1. Temporal Assertions for Sequential and Concurrent Programs
Prasanna Thati (email), University of Illinois at Urbana-Champaign
  1. Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols
Nikola Trcka (email), TU/e
  1. Verifying Chi Models with Spin
  2. Lumping of Markov Chains with Silent Steps
Olga Tveretina (email), TU/e
  1. Entropy-based design of Low Power FSMs.
  2. A Proof System and a Decision Procedure for Equality Logic
  3. DPLL-based Procedure for Equality Logic with Uninterpreted Functions
  4. A Non-clausal Procedure for Equality Logic with Uninterpreted Functions
Irek Ulidowski (email), Univ. of Leicester
  1. Orderings on rules and negative premises in Structural Operational Semantics
Yaroslav Usenko (email), LaQuSo, TU/e
  1. A comparison of muCRL toolset and Spin on a common example.
  2. Linearization of parallel pCRL processes.
  3. Equivalence of Recursive Specifications in Process Algebra
  4. Linearization in muCRL.
  5. Modeling of recursive sequential and parallel processes with equationally specified data types
  6. Linearization of Timed µCRL Specifications
  7. Using muCRL in the AMETIST project
  8. *Real*-time-based extensions of muCRL: current status, possible developments, place in the context.
  9. Time Abstraction in Timed muCRL a la Regions
Miguel Valero (email), CWI
  1. Using XML technology to develop an application for describing
    and cataloguing virtual components.
  2. Formal specification of JavaSpaces architecture using µCRL
  3. Towards abstract interpretation of µCRL models
  4. Modal Abstractions in mCRL from theory to practice.
  5. Proving Liveness by Abstracting Actions with Regular Expressions.
Machiel van der Bijl (email), Univ. of Twente
  1. Compositional testing with ioco
  2. Action Refinement in Model Based Testing
Jeroen van der Wulp (email), TU/e
  1. TraceFinder a (distributed) model-checker
Vincent van Oostrom (email), UU
  1. Orthogonal Rewriting.
  2. Normalising strategies for weakly orthogonal term rewrite systems
  3. Perpetuality.
  4. RPO revisited.
  5. Matching brackets.
  6. Retracing in Rewriting (using Residual systems).
  7. sub-Birkhoff
  8. Equivalence of reductions
  9. ]
  10. Strategies in term rewriting
  11. An other optimal implementation of the lambda calculus
  12. Commutative Residual Algebras (CRAs)
  13. FD a la Mellies
  14. Maximality by increasing diagrams
  15. Delimiting Diagrams
  16. Sorting vs. Braids vs. The Substitution Lemma
  17. A simple rewrite proof of the equational interpolation theorem
Simone Veglioni (email), UvA
  1. Hidden Abstract Machines
Sujith Vijay (email), CWI
  1. Finite Omega-Complete Axiomatisations for
    (0,S,T,F,<=,/\) and Related Algebras
Eelco Visser (email), Utrecht Univ.
  1. Program Transformation in Stratego.
  2. Scoped Dynamic Rewrite Rules.
  3. Composing Source-to-Source Data-Flow Transformations with Rewriting Strategies and Dependent Dynamic Rewrite Rules
Walter Vogler (email), Univ. Augsburg
  1. Decomposition in Asynchronous Circuit Design
Marc Voorhoeve (email), TU/e
  1. Impossible Futures and Determinism
  2. Liveness, Fairness and Impossible Futures
Duong Vu (email), UvA
  1. Structural Operational Semantics and Bounded Nondeterminism
  2. The compression structure of a process
Jos van Wamel (email), CWI
  1. The DIVA5 Project
  2. Timed µCRL
  3. The Parallel Composition of Uniform Processes with Data.
Joost Warners (email), CWI
  1. A Two Phase Algorithm for Solving a Class of Hard Satisfiability Problems.
  2. Satisfiability, linear and semidefinite programming, and pigeons.
Michael Weber (email), CWI
  1. Parallel Algorithms for Verification Large Systems
Anton J. Wijs (email), CWI
  1. Translating discrete-event Chi processes to LPEs
  2. Analyzing a Chi Model of a Turntable System using Spin, CADP and Uppaal
  3. Using Beam Search and Untimed Model Checking to Solve Scheduling Problems
Tim Willemse (email), TU/e
  1. A Case study in Hybrid Systems and Process Algebra.
  2. A Language Driven Approach to System Design
  3. Verification of pico CRL Specifications
Paulien de Wind (email), VU
  1. Modal logic in Coq
  2. Compositionality of Hennessy-Milner logic through structural operational semantics.
  3. Divide and Congruence
Toshiyuki Yamada (email)
  1. Confluence and Termination of Simply Typed Term Rewriting Systems.
Hans Zantema (email), TU/e
  1. Decision trees, decision tables and BDDs
  2. Resolution and BDDs cannot simulate each other polynomially
  3. Computing BDDs by rewriting.
  4. Transforming equality formulas to propositional formulas
  5. Liveness in Rewriting
Mark van der Zwaag (email), KUN
  1. Some verifications in process algebra with iota.
  2. On the semantics of timed muCRL.
  3. Timed cones and foci
  4. Time-stamped actions in pCRL algebras.
  5. A modal characterization of orthogonal bisimilarity.
  6. Semantics of UML state machines in PVS
Generated: Mon Jul 17 02:00:01 MEST 2006 by on apps.cwi.nl

Comments to Your PAM Organiser
CWI DISCLAIMER