default search action
Philippe Quéinnec
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j10]Armando Castañeda, Aurélie Hurault, Philippe Quéinnec, Matthieu Roy:
Tasks in modular proofs of concurrent algorithms. Inf. Comput. 292: 105040 (2023) - 2022
- [j9]Sara Houhou, Souheib Baarir, Pascal Poizat, Philippe Quéinnec, Laïd Kahloul:
A First-Order Logic verification framework for communication-parametric and time-aware BPMN collaborations. Inf. Syst. 104: 101765 (2022) - 2021
- [j8]Adam Shimi, Aurélie Hurault, Philippe Quéinnec:
Characterization and Derivation of Heard-Of Predicates for Asynchronous Message-Passing Models. Log. Methods Comput. Sci. 17(3) (2021) - [c29]Sara Houhou, Souheib Baarir, Pascal Poizat, Philippe Quéinnec:
A Direct Formal Semantics for BPMN Time-related Constructs. ENASE 2021: 138-149 - 2020
- [c28]Adam Shimi, Aurélie Hurault, Philippe Quéinnec:
Derivation of Heard-of Predicates from Elementary Behavioral Patterns. FORTE 2020: 133-149 - [i4]Adam Shimi, Aurélie Hurault, Philippe Quéinnec:
Derivation of Heard-Of Predicates From Elementary Behavioral Patterns. CoRR abs/2004.10619 (2020) - [i3]Adam Shimi, Aurélie Hurault, Philippe Quéinnec:
Characterization and Derivation of Heard-Of Predicates for Asynchronous Message-Passing Models. CoRR abs/2011.12879 (2020)
2010 – 2019
- 2019
- [j7]Florent Chevrou, Aurélie Hurault, Philippe Quéinnec:
A modular framework for verifying versatile distributed systems. J. Log. Algebraic Methods Program. 108: 24-46 (2019) - [c27]Sara Houhou, Souheib Baarir, Pascal Poizat, Philippe Quéinnec:
A First-Order Logic Semantics for Communication-Parametric BPMN Collaborations. BPM 2019: 52-68 - [c26]Florent Chevrou, Aurélie Hurault, Shin Nakajima, Philippe Quéinnec:
A Map of Asynchronous Communication Models. FM Workshops (2) 2019: 307-322 - [c25]Armando Castañeda, Aurélie Hurault, Philippe Quéinnec, Matthieu Roy:
Tasks in Modular Proofs of Concurrent Algorithms. SSS 2019: 69-83 - [c24]Aurélie Hurault, Philippe Quéinnec:
Proving a Non-blocking Algorithm for Process Renaming with TLA ^+ +. TAP@FM 2019: 147-166 - [i2]Armando Castañeda, Aurélie Hurault, Philippe Quéinnec, Matthieu Roy:
Tasks in Modular Proofs of Concurrent Algorithms. CoRR abs/1909.05537 (2019) - 2018
- [c23]Florent Chevrou, Aurélie Hurault, Philippe Quéinnec:
A Modular Framework for Verifying Versatile Distributed Systems. HPCS 2018: 748-755 - [c22]Adam Shimi, Aurélie Hurault, Philippe Quéinnec:
Characterizing Asynchronous Message-Passing Models Through Rounds. OPODIS 2018: 18:1-18:17 - [i1]Adam Shimi, Aurélie Hurault, Philippe Quéinnec:
Characterizing Asynchronous Message-Passing Models Through Rounds. CoRR abs/1805.01657 (2018) - 2017
- [c21]Nathanaël Sensfelder, Aurélie Hurault, Philippe Quéinnec:
Inference of Channel Priorities for Asynchronous Communication. DCAI 2017: 262-269 - [c20]Adam Shimi, Aurélie Hurault, Philippe Quéinnec:
Asynchronous Message Orderings Beyond Causality. OPODIS 2017: 29:1-29:20 - 2016
- [j6]Florent Chevrou, Aurélie Hurault, Philippe Quéinnec:
On the diversity of asynchronous communication. Formal Aspects Comput. 28(5): 847-879 (2016) - [j5]Serial Rayene Boussalia, Allaoua Chaoui, Aurélie Hurault, Meriem Ouederni, Philippe Quéinnec:
Multi-objective quantum inspired Cuckoo search algorithm and multi-objective bat inspired algorithm for the web service composition problem. Int. J. Intell. Syst. Technol. Appl. 15(2): 95-126 (2016) - [c19]Florent Chevrou, Aurélie Hurault, Philippe Mauran, Philippe Quéinnec:
Mechanized Refinement of Communication Models with TLA ^+ +. ABZ 2016: 312-318 - 2015
- [j4]Florent Chevrou, Aurélie Hurault, Philippe Quéinnec:
Automated Verification of Asynchronous Communicating Systems with TLA+. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 72 (2015) - 2013
- [j3]Nadège Pontisso, Philippe Quéinnec, Gérard Padiou:
Analysis of distributed multiperiodic systems to achieve consistent data matching. Concurr. Comput. Pract. Exp. 25(2): 234-249 (2013) - 2010
- [c18]Nadège Pontisso, Philippe Quéinnec, Gérard Padiou:
Analysis of distributed multi-periodic systems to achieve consistent data matching. NOTERE 2010: 81-88
2000 – 2009
- 2009
- [j2]Tanguy Le Berre, Philippe Mauran, Gérard Padiou, Philippe Quéinnec:
Real Time Behavior of Data in Distributed Embedded Systems. Scalable Comput. Pract. Exp. 10(3) (2009) - [c17]Nadège Pontisso, Philippe Quéinnec, Gérard Padiou:
Temporal data matching in component based real time systems. SIES 2009: 62-65 - 2008
- [c16]Tanguy Le Berre, Philippe Mauran, Gérard Padiou, Philippe Quéinnec:
Real time behavior of data in distributed embedded systems. IMCSIT 2008: 569-575 - [c15]Nadège Pontisso, Gérard Padiou, Philippe Quéinnec:
Real time data consistency in component based embedded systems. NOTERE 2008: 47:1-47:6 - 2007
- [c14]Philippe Mauran, Gérard Padiou, Philippe Quéinnec:
Separability to Help Parallel Simulation of Distributed Computations. OPODIS 2007: 358-371 - 2006
- [c13]Cezar Plesca, Romulus Grigoras, Philippe Quéinnec, Gérard Padiou, Jean Fanchon:
A Coordination-Level Middleware for Supporting Flexible Consistency in CSCW. PDP 2006: 316-321 - 2005
- [c12]Cezar Plesca, Romulus Grigoras, Philippe Quéinnec, Gérard Padiou:
A Flexible Communication Toolkit for Synchronous Groupware. Systems Communications 2005: 216-221 - [c11]Cezar Plesca, Romulus Grigoras, Philippe Quéinnec, Gérard Padiou:
Streaming with causality: a practical approach. ACM Multimedia 2005: 283-286 - [c10]Michel Charpentier, Gérard Padiou, Philippe Quéinnec:
Cooperative Mobile Agents to Gather Global Information. NCA 2005: 271-274 - [c9]Mamoun Filali, Valérie Issarny, Philippe Mauran, Gérard Padiou, Philippe Quéinnec:
Maximal Group Membership in Ad Hoc Networks. PPAM 2005: 51-58 - 2003
- [c8]Mamoun Filali, Philippe Mauran, Gérard Padiou, Philippe Quéinnec:
The Reconstruction of a Mobile Agent Computation and Its Validation. IPDPS 2003: 236 - 2000
- [c7]Mamoun Filali, Philippe Mauran, Gérard Padiou, Philippe Quéinnec, Xavier Thirioux:
Refinement Based Validation of an Algorithm for Detecting Distributed Termination. IPDPS Workshops 2000: 1027-1036 - [c6]Philippe Quéinnec, Mamoun Filali, Philippe Mauran, Gérard Padiou:
Describing Mobile Computations with Path Vectors. OPODIS 2000: 221-234
1990 – 1999
- 1999
- [j1]Michel Charpentier, Mamoun Filali, Philippe Mauran, Gérard Padiou, Philippe Quéinnec:
The Observation: An Abstract Communication Mechanism. Parallel Process. Lett. 9(3): 437-450 (1999) - [c5]Michel Charpentier, Mamoun Filali, Philippe Mauran, Gérard Padiou, Philippe Quéinnec:
Modelling and Verifying Migration: A case study. OPODIS 1999: 149-164 - 1998
- [c4]Michel Charpentier, Mamoun Filali, Philippe Mauran, Gérard Padiou, Philippe Quéinnec:
Tailoring UNITY to Distributed Program Design. IPPS/SPDP Workshops 1998: 820-832 - 1996
- [c3]Michel Charpentier, Mamoun Filali, Philippe Mauran, Gérard Padiou, Philippe Quéinnec:
Abstracting Communication to Reason about Distributed Algorithms. WDAG 1996: 89-104 - 1994
- [c2]Philippe Quéinnec, Gérard Padiou:
Derivation of Fault Tolerance Properties of Distributed Algorithms. PODC 1994: 382 - 1993
- [c1]Philippe Quéinnec, Gérard Padiou:
Flight plan management in a distributed air traffic control system. ISADS 1993: 323-329
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint