, Construction and Analysis of Transition Systems with MEC A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems Appraising Fairness in Languages for Distributed Programming, Proceedings of the 14th Annual ACM Symposium on Principles of Programming Languages POPL '87 Mí unich ëAnd91ë G. R. Andrews. Concurrent Programming: Principles and Practice. Benjamin-Cummings, 1991. ëAnd92ë H. R. Andersen. Model Checking and Boolean Graphs Proceedings of the 4th European Symposium on Programming ESOP '92, pp.57-66, 1987.
, Model Checking and Boolean Graphs MEC: A System for Constructing and Analysing Transition Systems, Automatic veriaecation of aenite state systems,v olume 407 of Lecture Notes in Computer Science, pp.3-30, 1989.
, Syst emes de transitions aenis et s emantique des processus communicants. Masson, 1992. ëAS85ë B. Alpern and F. B. Schneider. Deaening Liveness, Information Processing Letters, vol.21, pp.181-185, 1985.
, Compilers: Principles, Techniques and Tools, 1986.
, The Temporal Logic of Branching Time A Study of an Extended Temporal Language and a Temporal Fixed Point Calculus Eaecient Model Checking via the Equational -calculus Eaecient On-the-Fly Model Checking for CTL, Proceedings of POPL '81 Proceedings of the 11th Annual Symposium on Logic in Computer Science LICS '96 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science LICS '95, pp.207-226, 1983.
, The Integration Project for the JACK Environment A Theory of Communicating Sequential Processes, Bulletin of the EATCS Journal of the ACM. Algebra of Communicating Processes with Abstraction. Theoretical Computer Science, vol.54, issue.37, pp.207-223560, 1984.
, The Fc2Tools set: aToolset for the Veriaecation of Concurrent Systems, Proceedings of the 8th Conference on Computer-AidedV eriaecation, 1996.
, Automatic Veriaecation of Finite-State Concurrent Systems using Temporal Logic Speciaecations, ëCKS92ë R. Cleaveland, M. Klein, and B. Steaeen. Faster Model Checking for the Modal Mu-Calculus, pp.244-263117, 1974.
, The Concurrency Factory: A development environment for concurrent systems, Proceedings of the 8th Workshop on Computer Aided Veriaecation CAV '96, pp.398-401, 1996.
DOI : 10.1007/3-540-61474-5_88
, The concurrency workbench, Lecture Notes in Computer Science, vol.407, pp.24-37, 1989.
DOI : 10.1007/3-540-52148-8_3
, Computing behavioural relations, logically, Proceedings of the 18th ICALP Proceedings of 3rd Workshop on Computer AidedV eriaecation CAV '91 ëCS93ë R. Cleaveland and B. Steaeen. A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus. Formal Methods in System Design, pp.127-138, 1991.
DOI : 10.1007/3-540-54233-7_129
, Memory efficient algorithms for the verification of temporal properties, Proceedings of the 2nd International Conference on Computer AidedV eriaecation CAV '90, pp.233-242, 1990.
DOI : 10.1007/BFb0023737
, Ctl and Ectl as Fragments of the Modal -calculus. Theoretical Computer Science, 126611:77í96, ëDam94bë M. Dam. Model Checking Mobile Processes Full versionn, 1994.
, 33 Examples of Termination ëDic86ë A. Dicky. An Algebraic and Algorithmic Method for Analysing Transition Systems, Term rewriting Theoretical Computer Science, pp.4662-33285, 1986.
, Three Logics for Branching Bisimulation Characterizing Correctness Properties of Parallel Programs using Fixpoints Using Branching Time Logic to Synthesize Synchronization Skeletons Revisited: On Branching versus Linear Time Revisited: On Branching versus Linear Time Temporal Logic, Proceedings of the 5th Symposium in Logic in Computer Science LICS '90 Proceedings of the 7th ICALP Proceedings of the 10th Annual ACM Symposium on Principles of Programming Languages POPL '83, pp.118-129, 1980.
, Modalities for Model Checking: Branching Time Logic Strikes Back Also appeared in Science of Computer Programming Eaecient Model Checking in Fragments of the Propositional Mu- Calculus Branching Time Temporal Logic Linear time, branching time and partial order in logics and models of concurrency CADP CçSARèALDEBARAN DevelopmentPackagee: A Protocol Validation and Veriaecation Toolbox, Proceedings of the 5th International Conference on Computer Aided Veriaecation CAV '93 Elounda Proceedings of the 12th Annual ACM Symposium on Principles of Programming Languages POPL '85 New Orleanss Proceedings of the 1st LICS ëFGK + 96ë Jean-Claude Fernandez, Hubert Garavel Proceedings of the 8th Conference on Computer-AidedV eriaecation Propositional Dynamic Logic of Regular Programs. Journal of Computer and System Sciences, pp.385-396, 1979.
, Compilation et v eriaecation de programmes LOTOS, Th ese de Doctorat, 1989.
, Compilation of LOTOS Abstract Data Types, Proceedings of the 2nd International ConferenceonF ormal Description Techniques FORTE'89 Vancouver B.C., Canadaa, pages 147í162. North-Holland, 1989.
, OPENèCAESAR: An Open Software Architecture for Veriaecation, Simulation, and Testing, Proceedings of 1st International Conference on Tools and Algorithms for the Construction and Analysis of Systems TACAS'98, 1998.
, CADP'97 í Status, Applications and Perspectives The Syntax and Semantics of CRL On the Temporal Analysis of Fairness, Proceedings of the 2nd COST 247 International Workshop on AppliedFormal Methods in System Design Proceedings of the 7th Annual ACM Symposium on Principles of Programming Languages POPL '80 Las Vegas, pp.163-173, 1980.
, What are the Limits of Model Checking Methods for the Veriaecation of Real Life Protocols? A Logic for the Description of Non-deterministic Programs and Their Properties Compilation and Veriaecation of LOTOS Speciaecations, Proceedings of the 1st Workshop on Automatic Veriaecation Methods for Finite State Systems Grenoble, Francee,v olume 407 of Lecture Notes in Computer Science Proceedings of the 10th International Symposium on Protocol Speciaecation, Testing and Veriaecation ëGT93ë Hubert Garavel and Philippe Turlier. CçSAR.ADT : un compilateur pour les types abstraits alg ebriques du langage LOTOS Actes du Colloque Francophone pour l'Ing enierie des Protocoles CFIP'93 Montr eal, pp.275-285254, 1986.
, Technical Report Logic Group Preprint Series 100 A Modal Logic for CRL Logic Group Preprint Series Branching Time Regular Temporal Logic for Model Checking with Linear Time Complexity, Proceedings of the 2nd International Conference on Computer AidedV eriaecation CAV '90 School of Cognitive and Computing Sciences ëHL93ë M. Hennessy and X. Liu. A Modal Logic for Message Passing Processes. Report 3è93, School of Cognitive and Computing Sciences ëHol91ë Gerard J. Holzmann. Design and Validation of Computer Protocols. Software Series, pp.253-262137, 1985.
, Proof-checking a data link protocol, Proceedings of the 1st International Workshop ëTypes for Proofs and Programs, pp.127-165, 1993.
DOI : 10.1007/3-540-58085-9_75
, Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree, Proceedings of the 14th ICALP Karlsruhe, Germanyy ëIS94ë A. Ingolfsdottir and B. Steaeen. Characteristic Formulae for Processes with Divergence. Information and Computation, pp.269-279149, 1987.
DOI : 10.1007/3-540-18088-5_22
, AF ormal Description Technique Based on an Extended State Transition Model, International Organization for Standardization | Information Processing Systems | Open Systems Interconnection, Gen eve, 1988.
, Automatic Veriaecation of Finite State Systems Bounded-memory Algorithms for Veriaecation On-the-aey, Proceedings of 3rd Workshop on Computer Aided Veriaecation CAV '91, pp.189-196, 1989.
, Introduction to Metamathematics. North-Holland Semantics of Context-Free Languages, Lecture Notes in Computer Science Math. Syst. Theory, vol.2, issue.27, pp.192-202127, 1952.
, On the Temporal Logic of Programs Proof Systems for Hennessy-Milner logic with Recursion Eaecient Local Correctness Checking Logique temporelle avecp ass ep our la sp eciaecation et la v eriaecation des syst emes r eactifs An Improved Algorithm for the Evaluation of Fixpoint Expressions, Proceedings of the 7th Annual ACM Symposium on Principles of Programming Languages POPL '80 Las Vegas, Nevadaa ëLam83ë L. Lamport. What Good is Temporal Logic? Information Processing Proceedings of the 13th Colloquium on Trees in Algebra and Programming CAAP '88 Nancy, Francee Proceedings of 4th International Workshop in Computer AidedV eriaecation CAV '92 Montr eal, Canadaa Th ese de Doctorat Proceedings of the 6th International Conference on Computer AidedV eriaecation CAV '94 of Lecture Notes in Computer Science Proceedings of the 12th Annual ACM Symposium on Principles of Programming Languages POPL '85 New Orleanss, pp.163-173657, 1980.
, The Glory of the Past ëLut97ë Bas Luttik. Description and Formal Speciaecation of the Link Layer of P1394, Proceedings of the International ConferenceofLogics of Programs Brooklynn Proceedings of the 2nd COST 247 International Workshop on Applied Formal Methods in System Design, 1985.
, Optimisation de la compilation des types abstraits alg ebriques du langage LOTOS. M emoire d'ing enieur Formal Description and Analysis of a Bounded Retransmission Protocol, Proceedings of the COST 247 International Workshop on AppliedFormal Methods in System Design Maribor, Sloveniaa, pp.98-113, 1993.
, The AnchoredV ersion of the Temporal Framework Linear time, branching time and partial order in logics and models of concurrency ëMP92ë Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems, volume I: Speciaecation Algebraic Speciaecation of Communication Protocols. Number 36 in Cambridge Tracts in Theoretical Computer Science An Action-Based Framework for Verifying Logical and Behavioural Properties of Concurrent Systems Action versus State basedL ogics for Transition Systems, ëMat97ë Radu Mateescu. V eriaecation de syst emes r epartis : l'exemple du protocole Brp. Technique et Science Informatiques Proceedings of the 9th ACM Symp. on Principles of Distributed Computing Proceedings of 3rd Workshop on Computer Aided Veriaecation CAV '91 Proceedings Ecole de Printemps on Semantics of Concurrency ëPar81ë David Park. Concurrency and Automata on Inaenite Sequences Theoretical Computer Science ëPec98ë Charles Pecheur. Advanced Modelling and Veriaecation Techniques Applied to a Cluster File System. Research Report RR-3416 CFS. ëPlo81ë G. Plotkin. A Structural Approach to Operational Semantics ëQue82ë J.-P. Queille. Le syst eme CESAR : description, sp eciaecation et analyse des applications reparties, pp.725-751, 1981.
, Local Model Checking for a Value-Based Modal -calculus, School of Cognitive and Computing Sciences, 1996.
, Sp eciaecation et validation de syst emes en XESAR.T h ese de Doctorat, 1988.
, Testing and Veriaecation Zurichh ëRuf94ë Renaud Ruaeot. D eaenition et r ealisation d'un atelier logiciel pour l' etude des syst emes de transitions . M emoire d'ing enieur CNAM, INRIA Rh^ one-Alpes Complexity of Propositional Linear Temporal Logics QUASAR : une r ealisation du syst eme CESAR Denotational Semantics: a Methodology for Language Development Impl ementation optimis ee des types abstraits alg ebriques du langage LOTOS. M emoire d'ing enieur de l'Institut Polytechnique de Validation of the Link Layer Protocol of the IEEE-1394 Serial Bus ëFireWire"": an Experiment with E-LOTOS Full version available as INRIA Research Report RR-3172. ëSti87ë C. Stirling. Modal Logics for Communicating Systems. Theoretical Computer Science, 4992- 33:311í347, 1987. ëSti92ë C. Stirling. Modal and Temporal Logics for Processes, XESAR of the Sliding Window Protocol Proceedings of the 7th International Symposium on Protocol Speciaecation Th ese de Docteur-Ing enieur ëSM97ë Mihaela Sighireanu and Radu Mateescu Proceedings of the 2nd COST 247 International Workshop on Applied Formal Methods in System Design ëStr82ë R. Streett. Propositional Dynamic Logic of Looping and Converse. Information and Control ëSVW87ë A. P. Sistla, M. Y. Vardi, and P.W olper. The Complementation Problem for Bí uchi Automata with Applications to Temporal Logic. Theoretical Computer Science ëSW91ë C. Stirling and D. Walker. Local Model Checking in the Modal Mu-Calculus. Theoretical Computer Science, pp.733-749121, 1955.
, Computation tree logic and regular ??-languages, Proceedings of the 15th Annual ACM Symposium on Principles of Programming Languages POPL '88 Also in proc. IFIP 11th World Computer Congress Proceedings of the 17th Colloquium on Trees in Algebra and Programming CAAP '92, pp.690-713, 1988.
DOI : 10.1007/BFb0013041
, A Linear Local Model-Checking Algorithm for CTL Eaecient Local Correctness Checking for Single and Alternating Boolean Equation Systems ëVM94ë B. Victor and F. Moller. The MobilityW orkbenchíAT ool for the -Calculus, Proceedings of CONCUR '93 Proceedings of the 21st ICALP Viennaa Proceedings of the 6th Conference on Computer-Aided Veriaecation CAV '94, pp.447-461, 1993.
, Efficient fixpoint computation, Proceedings of the 1st International Static Analysis Symposium SAS '94 Namur, Belgiumm, pp.314-328157, 1983.
DOI : 10.1007/3-540-58485-4_49