default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Mullins
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j24]Ikhlass Ammar
, Yamen El Touati, John Mullins, Moez Yeddes:
Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language. Int. J. Found. Comput. Sci. 32(2): 175-202 (2021)- [j23]Ikhlass Ammar, Yamen El Touati, Moez Yeddes, John Mullins:
Bounded opacity for timed systems. J. Inf. Secur. Appl. 61: 102926 (2021) - [c34]Paulina Stevia Nouwou Mindom, Amin Nikanjam, Foutse Khomh, John Mullins:
On Assessing The Safety of Reinforcement Learning algorithms Using Formal Methods. QRS 2021: 260-269 - [i7]Paulina Stevia Nouwou Mindom, Amin Nikanjam, Foutse Khomh, John Mullins:
On Assessing The Safety of Reinforcement Learning algorithms Using Formal Methods. CoRR abs/2111.04865 (2021)
2010 – 2019
- 2019
- [j22]Sofiene Beji, Sardaouna Hamadou, John Mullins, Abdelouahed Gherbi:
Iterative integration of TTEthernet network flows. Int. J. Crit. Comput. Based Syst. 9(3): 167-192 (2019) - 2018
- [j21]Béatrice Bérard, Olga Kouchnarenko, John Mullins, Mathieu Sassolas:
Opacity for linear constraint Markov chains. Discret. Event Dyn. Syst. 28(1): 83-108 (2018) - [c33]Loïc Hélouët, Hervé Marchand, John Mullins:
Concurrent Secrets with Quantified Suspicion. ACSD 2018: 75-84 - 2017
- [j20]Tiyam Robati, Abdelouahed Gherbi, Amine El Kouhen, John Mullins:
Design and simulation of distributed IMA architectures using TTEthernet: a model-driven approach. J. Ambient Intell. Humaniz. Comput. 8(3): 345-355 (2017) - [j19]Béatrice Bérard, Loïc Hélouët, John Mullins:
Non-interference in Partial Order Models. ACM Trans. Embed. Comput. Syst. 16(2): 44:1-44:34 (2017) - [c32]Edmund Spencer, David Clark, Samuel Russ, Ravi Gollapalli, Dimitris Vassiliadis, Brannon Kerrigan, John Mullins, Jeffrey Mizell:
First results from a time domain impedance probe for measuring plasma properties in the ionosphere. MWSCAS 2017: 1284-1287 - 2016
- [j18]Tiyam Robati, Amine El Kouhen, Abdelouahed Gherbi, John Mullins:
Time-Triggered Ethernet Metamodel: Design and Application. J. Softw. 11(10): 1040-1053 (2016) - [c31]Tiyam Robati, Abdelouahed Gherbi, John Mullins:
A Modeling and Verification Approach to the Design of Distributed IMA Architectures Using TTEthernet. ANT/SEIT 2016: 229-236 - [c30]Sofiene Beji, Abdelouahed Gherbi, John Mullins, Pierre-Emmanuel Hladik:
Model-Driven Approach to the Optimal Configuration of Time-Triggered Flows in a TTEthernet Network. SAM 2016: 164-179 - [c29]Béatrice Bérard, Olga Kouchnarenko, John Mullins, Mathieu Sassolas:
Preserving opacity on Interval Markov Chains under simulation. WODES 2016: 319-324 - [p2]Sardaouna Hamadou, John Mullins, Abdelouahed Gherbi:
A Real-Time Concurrent Constraint Calculus for Analyzing Avionic Systems Embedded in the IMA Connected Through TTEthernet. Theoretical Information Reuse and Integration 2016: 85-111 - 2015
- [j17]Béatrice Bérard, John Mullins, Mathieu Sassolas:
Quantifying opacity. Math. Struct. Comput. Sci. 25(2): 361-403 (2015) - [c28]Béatrice Bérard, Loïc Hélouët, John Mullins:
Non-interference in Partial Order Models. ACSD 2015: 80-89 - [c27]Sardaouna Hamadou, John Mullins, Christophe Chareton, Abdelouahed Gherbi:
Specifying Avionic Embedded Systems by Denotations of the Time-Triggered Constraint-Based Calculus. IRI 2015: 303-310 - [c26]Sardaouna Hamadou, John Mullins, Abdelouahed Gherbi, Sofiene Beji:
A Time-Triggered Constraint-Based Calculus for Avionic Systems. ISORC Workshops 2015: 58-65 - [c25]Tiyam Robati, Amine El Kouhen, Abdelouahed Gherbi, John Mullins:
Simulation-Based Verification of Avionic Systems Deployed on IMA Architectures. P&D@MoDELS 2015: 56-59 - [i6]Béatrice Bérard, Olga Kouchnarenko, John Mullins, Mathieu Sassolas:
Probabilistic Opacity in Refinement-Based Modeling. CoRR abs/1510.04316 (2015) - 2014
- [j16]Béatrice Bérard, John Mullins:
Verification of Information Flow Properties under Rational Observation. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 70 (2014) - [c24]Sofiene Beji, Sardaouna Hamadou, Abdelouahed Gherbi, John Mullins:
SMT-Based Cost Optimization Approach for the Integration of Avionic Functions in IMA and TTEthernet Architectures. DS-RT 2014: 165-174 - [c23]Robati Tiyam, Amine El Kouhen, Abdelouahed Gherbi, Sardaouna Hamadou, John Mullins:
An Extension for AADL to Model Mixed-Criticality Avionic Systems Deployed on IMA architectures with TTEthernet. ACVI@MoDELS 2014 - [c22]John Mullins, Moez Yeddes:
Opacity with Orwellian Observers and Intransitive Non-Interference. WODES 2014: 344-349 - [i5]Béatrice Bérard, John Mullins:
Verification of Information Flow Properties under Rational Observation. CoRR abs/1409.0871 (2014) - [i4]Sardaouna Hamadou, Abdelouahed Gherbi, John Mullins, Sofiene Beji:
A Time-Triggered Constraint-Based Calculus for Avionic Systems. CoRR abs/1410.3694 (2014) - 2013
- [j15]Faisal Abouzaid, Manuel Mazzara, John Mullins, Nafees Qamar:
Towards a formal analysis of dynamic reconfiguration in WS-BPEL. Intell. Decis. Technol. 7(3): 213-224 (2013) - [c21]Michaël Lauer, John Mullins, Moez Yeddes:
Cost Optimization Strategy for Iterative Integration of Multi-critical Functions in IMA and TTEthernet Architecture. COMPSAC Workshops 2013: 139-144 - [i3]Béatrice Bérard, John Mullins, Mathieu Sassolas:
Quantifying Opacity. CoRR abs/1301.6799 (2013) - [i2]John Mullins, Moez Yeddes:
Opacity with Orwellian Observers and Intransitive Non-interference. CoRR abs/1312.6426 (2013) - 2012
- [j14]Gilles Benattar, Béatrice Bérard, Didier Lime, John Mullins, Olivier H. Roux, Mathieu Sassolas:
Channel Synthesis for Finite Transducers. Int. J. Found. Comput. Sci. 23(6): 1241-1260 (2012) - [c20]Faisal Abouzaid, John Mullins, Manuel Mazzara, Nicola Dragoni:
Modelling and Analysis of Dynamic Reconfiguration in BP-Calculus. KES-AMSTA 2012: 534-543 - 2011
- [c19]Gilles Benattar, Béatrice Bérard, Didier Lime, John Mullins, Olivier H. Roux, Mathieu Sassolas:
Channel Synthesis for Finite Transducers. AFL 2011: 79-92 - 2010
- [j13]Sardaouna Hamadou, John Mullins:
Calibrating the power of schedulers for probabilistic polynomial-time calculus. J. Comput. Secur. 18(2): 265-316 (2010) - [c18]Béatrice Bérard, John Mullins, Mathieu Sassolas:
Quantifying Opacity. QEST 2010: 263-272
2000 – 2009
- 2009
- [j12]Domhnaill Hernon, Todd Salamon, Roger Kempers, Shankar Krishnan, Alan Lyons, Marc Hodes, Paul Kolodner, John Mullins, Liam McGarry:
Thermal management: Enabling enhanced functionality and reduced carbon footprint. Bell Labs Tech. J. 14(3): 7-19 (2009) - [c17]Faisal Abouzaid, John Mullins:
Model-checking Web Services Orchestrations using BP-calculus. FOCLASA 2009: 3-21 - 2008
- [c16]Faisal Abouzaid, John Mullins:
Formal Specification of Correlation in WS Orchestrations Using BP-calculus. FACS 2008: 3-24 - 2007
- [c15]John Mullins, Raveca Oarga:
Model Checking of Extended OCL Constraints on UML Models in SOCLe. FMOODS 2007: 59-75 - [c14]Daniel Boteanu, José M. Fernandez, John McHugh, John Mullins:
Queue Management as a DoS Counter-Measure? ISC 2007: 263-280 - [c13]Faisal Abouzaid, John Mullins:
A Calculus for Generation, Verification and Refinement of BPEL Specifications. WWV 2007: 43-65 - [c12]Srecko Brlek, Sardaouna Hamadou, John Mullins:
A Probabilistic Scheduler for the Analysis of Cryptographic Protocols. SecCO@CONCUR 2007: 61-83 - 2006
- [j11]Srecko Brlek, Sardaouna Hamadou, John Mullins:
A flaw in the electronic commerce protocol SET. Inf. Process. Lett. 97(3): 104-108 (2006) - [j10]Siva Anantharaman, Paul Gastin, Gaétan Hains, John Mullins, Michaël Rusinowitch:
Editorial. J. Autom. Lang. Comb. 11(1): 5-6 (2006) - [c11]Srecko Brlek, Sardaouna Hamadou, John Mullins:
Some Remarks on the Certificates Registration of the Electronic Commerce Protocol SET. AICT/ICIW 2006: 119 - [c10]Samuel Galice, Marine Minier, John Mullins, Stéphane Ubéda:
Cryptographic Protocol to Establish Trusted History of Interactions. ESAS 2006: 136-149 - [c9]Samuel Galice, Véronique Legrand, Marine Minier, John Mullins, Stéphane Ubéda:
A History-Based Framework to Build Trust Management Systems. SecureComm 2006: 1-7 - [i1]Samuel Galice, Véronique Legrand, Marine Minier, John Mullins, Stéphane Ubéda:
The KAA project: a trust policy point of view. CoRR abs/cs/0606005 (2006) - 2005
- [j9]Srecko Brlek, Sardaouna Hamadou, John Mullins:
Anonymous and Secure Electronic Transaction protocol. Ann. des Télécommunications 60(5-6): 530-557 (2005) - [j8]Nejib Ben Hadj-Alouane, Stéphane Lafrance, Feng Lin, John Mullins, Moez Yeddes:
Characterizing intransitive noninterference for 3-domain security policies with observability. IEEE Trans. Autom. Control. 50(6): 920-925 (2005) - [j7]Nejib Ben Hadj-Alouane, Stéphane Lafrance, Feng Lin, John Mullins, Mohamed Moez Yeddes:
On the verification of intransitive noninterference in multilevel security. IEEE Trans. Syst. Man Cybern. Part B 35(5): 948-958 (2005) - [c8]Alaaeddine Fellah, John Mullins:
Admissible Interference by Typing for Cryptographic Protocols. ICICS 2005: 123-135 - [c7]Guillaume Gardey, John Mullins, Olivier H. Roux:
Non-Interference Control Synthesis for Security Timed Automata. SecCO@CONCUR 2005: 35-53 - 2004
- [c6]Nejib Ben Hadj-Alouane, Stéphane Lafrance, Feng Lin, John Mullins, Moez Yeddes:
An algorithmic approach to verification of intransitive non-interference in security policies. CDC 2004: 51-56 - 2003
- [j6]John Mullins, Stéphane Lafrance:
Bisimulation-based non-deterministic admissible interference and its application to the analysis of cryptographic protocols. Inf. Softw. Technol. 45(11): 779-790 (2003) - [j5]Stéphane Lafrance, John Mullins:
An Information Flow Method to Detect Denial of Service Vulnerabilities. J. Univers. Comput. Sci. 9(11): 1350- (2003) - [j4]Hanifa Boucheneb, John Mullins:
Analyse des réseaux temporels. Calcul des classes en O(n2) et des temps de chemin en O(m x n). Tech. Sci. Informatiques 22(4): 435-459 (2003) - [c5]Stéphane Lafrance, John Mullins:
Using Admissible Interference to Detect Denial of Service Vulnerabilities. IWFM 2003 - 2002
- [c4]Stéphane Lafrance, John Mullins:
Bisimulation-based Non-deterministic Admissible Interference and its Application to the Analysis of Cryptographic Protocols. CATS 2002: 154-177 - 2001
- [j3]Gaétan Hains, Frédéric Loulergue, John Mullins:
Concrete data structures and functional parallel programming. Theor. Comput. Sci. 258(1-2): 233-267 (2001) - 2000
- [j2]John Mullins:
Nondeterministic Admissible Interference. J. Univers. Comput. Sci. 6(11): 1054-1070 (2000)
1990 – 1999
- 1997
- [j1]John Mullins:
On an Effective Hierarchy of Communicating Processes: Separation Principle and Testing. Theor. Comput. Sci. 174(1-2): 231-246 (1997) - [p1]Jules Desharnais, Bernard Hodgson, John Mullins:
Linear Logic. Relational Methods in Computer Science 1997: 106-114 - 1996
- [c3]Gaétan Hains, John Mullins:
Array Structures and Data-Parallel Algorithms. Euro-Par, Vol. II 1996: 409-416 - 1995
- [c2]Gaétan Hains, John Mullins:
A Metacircular Data-Parallel Functional Language. Euro-Par 1995: 711-714 - 1992
- [c1]John Mullins:
Kleene Automata and Recursion Theory. LFCS 1992: 336-346
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-05-08 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
