2008 |
23 | EE | Faisal Abouzaid,
John Mullins:
A Calculus for Generation, Verification and Refinement of BPEL Specifications.
Electr. Notes Theor. Comput. Sci. 200(3): 43-65 (2008) |
2007 |
22 | EE | John Mullins,
Raveca Oarga:
Model Checking of Extended OCL Constraints on UML Models in SOCLe.
FMOODS 2007: 59-75 |
21 | EE | Daniel Boteanu,
José M. Fernandez,
John McHugh,
John Mullins:
Queue Management as a DoS Counter-Measure?
ISC 2007: 263-280 |
20 | EE | Guillaume Gardey,
John Mullins,
Olivier H. Roux:
Non-Interference Control Synthesis for Security Timed Automata.
Electr. Notes Theor. Comput. Sci. 180(1): 35-53 (2007) |
19 | EE | Srecko Brlek,
Sardaouna Hamadou,
John Mullins:
A Probabilistic Scheduler for the Analysis of Cryptographic Protocols.
Electr. Notes Theor. Comput. Sci. 194(1): 61-83 (2007) |
2006 |
18 | EE | Srecko Brlek,
Sardaouna Hamadou,
John Mullins:
Some Remarks on the Certificates Registration of the Electronic Commerce Protocol SET.
AICT/ICIW 2006: 119 |
17 | EE | Samuel Galice,
Marine Minier,
John Mullins,
Stéphane Ubéda:
Cryptographic Protocol to Establish Trusted History of Interactions.
ESAS 2006: 136-149 |
16 | EE | 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) |
15 | EE | Srecko Brlek,
Sardaouna Hamadou,
John Mullins:
A flaw in the electronic commerce protocol SET.
Inf. Process. Lett. 97(3): 104-108 (2006) |
2005 |
14 | EE | Alaaeddine Fellah,
John Mullins:
Admissible Interference by Typing for Cryptographic Protocols.
ICICS 2005: 123-135 |
13 | | Srecko Brlek,
Sardaouna Hamadou,
John Mullins:
Anonymous and Secure Electronic Transaction protocol.
Annales des Télécommunications 60(5-6): 530-557 (2005) |
12 | EE | Nejib Ben Hadj-Alouane,
Stéphane Lafrance,
Feng Lin,
John Mullins,
Mohamed Moez Yeddes:
On the verification of intransitive noninterference in multilevel security.
IEEE Transactions on Systems, Man, and Cybernetics, Part B 35(5): 948-958 (2005) |
2003 |
11 | EE | Stéphane Lafrance,
John Mullins:
Using Admissible Interference to Detect Denial of Service Vulnerabilities.
IWFM 2003 |
10 | EE | John Mullins,
Stéphane Lafrance:
Bisimulation-based non-deterministic admissible interference and its application to the analysis of cryptographic protocols.
Information & Software Technology 45(11): 779-790 (2003) |
9 | EE | Stéphane Lafrance,
John Mullins:
An Information Flow Method to Detect Denial of Service Vulnerabilities.
J. UCS 9(11): 1350- (2003) |
8 | EE | 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).
Technique et Science Informatiques 22(4): 435-459 (2003) |
2002 |
7 | EE | Stéphane Lafrance,
John Mullins:
Bisimulation-based Non-deterministic Admissible Interference and its Application to the Analysis of Cryptographic Protocols.
Electr. Notes Theor. Comput. Sci. 61: (2002) |
2001 |
6 | EE | 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 |
5 | EE | John Mullins:
Nondeterministic Admissible Interference.
J. UCS 6(11): 1054-1070 (2000) |
1997 |
4 | EE | John Mullins:
On an Effective Hierarchy of Communicating Processes: Separation Principle and Testing.
Theor. Comput. Sci. 174(1-2): 231-246 (1997) |
1996 |
3 | | Gaétan Hains,
John Mullins:
Array Structures and Data-Parallel Algorithms.
Euro-Par, Vol. II 1996: 409-416 |
1995 |
2 | | Gaétan Hains,
John Mullins:
A Metacircular Data-Parallel Functional Language.
Euro-Par 1995: 711-714 |
1992 |
1 | | John Mullins:
Kleene Automata and Recursion Theory.
LFCS 1992: 336-346 |