Dusko Pavlovic

Orcid: 0000-0002-9855-6861

Affiliations:
  • University of Hawaii, Honolulu, HI, USA


According to our database1, Dusko Pavlovic authored at least 99 papers between 1991 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Language processing in humans and computers.
CoRR, 2024

2023
From Gödel's Incompleteness Theorem to the completeness of bot religions (Extended abstract).
CoRR, 2023

From Gödel's Incompleteness Theorem to the Completeness of Bot Beliefs - (Extended Abstract).
Proceedings of the Logic, Language, Information, and Computation, 2023

Programs as Diagrams - In cooperation with the association Computability in Europe
Springer, ISBN: 978-3-031-34826-6, 2023

2022
Categorical Computability in Monoidal Computer: Programs as Diagrams.
CoRR, 2022

Tight limits and completions from Dedekind-MacNeille to Lambek-Isbell.
CoRR, 2022

Lambek pregroups are Frobenius spiders in preorders.
Compositionality, 2022

2021
Probabilistic annotations for protocol models.
CoRR, 2021

Decision Support for Sharing Data using Differential Privacy.
Proceedings of the IEEE Symposium on Visualization for Cyber Security, 2021

Probabilistic Annotations for Protocol Models - Dedicated to Joshua Guttman.
Proceedings of the Protocols, Strands, and Logic, 2021

2020
Dynamic Distributed Secure Storage Against Ransomware.
IEEE Trans. Comput. Soc. Syst., 2020

Abstract extensionality: on the properties of incomplete abstract interpretations.
Proc. ACM Program. Lang., 2020

Logic of fusion.
CoRR, 2020

Retracing some paths in categorical semantics: From process-propositions-as-types to categorified real numbers and monoidal computers.
CoRR, 2020

The nucleus of an adjunction and the Street monad on monads.
CoRR, 2020

Logic of Fusion - - Dedicated to Andre Scedrov -.
Proceedings of the Logic, 2020

2019
Logics for Actor Networks: A two-stage constrained-hybridisation approach.
J. Log. Algebraic Methods Program., 2019

Causality and deceit: Do androids watch action movies?
CoRR, 2019

Policy Creation for Enterprise-Level Data Sharing.
Proceedings of the HCI for Cybersecurity, Privacy and Trust, 2019

Privacy Protocols.
Proceedings of the Foundations of Security, Protocols, and Equational Reasoning, 2019

2018
Intensional and extensional aspects of computation: From computability and complexity to program analysis and security (NII Shonan Meeting 2018-1).
NII Shonan Meet. Rep., 2018

Sound up-to techniques and Complete abstract domains.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Monoidal Computer III: A Coalgebraic View of Computability and Complexity (Extended Abstract).
Proceedings of the Coalgebraic Methods in Computer Science, 2018

2017
Smooth coalgebra: testing vector analysis.
Math. Struct. Comput. Sci., 2017

A Multisecret Value Access Control Framework for Airliner in Multinational Air Traffic Management.
IEEE Internet Things J., 2017

Functorial Semantics for Relational Theories.
CoRR, 2017

Monoidal computer III: A coalgebraic view of computability and complexity.
CoRR, 2017

Universal probability-free prediction.
Ann. Math. Artif. Intell., 2017

Logics for Actor Networks: A Case Study in Constrained Hybridization - A Case Study in Constrained Hybridization.
Proceedings of the Dynamic Logic. New Trends and Applications, 2017

Quotients in monadic programming: Projective algebras are equivalent to coalgebras.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Refinement for Signal Flow Graphs.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
(Modular) Effect Algebras are Equivalent to (Frobenius) Antispecial Algebras.
Proceedings of the Proceedings 13th International Conference on Quantum Physics and Logic, 2016

Universal Probability-Free Conformal Prediction.
Proceedings of the Conformal and Probabilistic Prediction with Applications, 2016

2015
Testing randomness by Matching Pennies.
CoRR, 2015

Towards a science of trust.
Proceedings of the 2015 Symposium and Bootcamp on the Science of Security, 2015

Towards Concept Analysis in Categories: Limit Inferior as Algebra, Limit Superior as Coalgebra.
Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

2014
Monoidal computer II: Normal complexity by string diagrams.
CoRR, 2014

Chasing Diagrams in Cryptography.
Proceedings of the Categories and Types in Logic, Language, and Physics, 2014

2013
Security Policy Alignment: A Formal Approach.
IEEE Syst. J., 2013

A new description of orthogonal bases.
Math. Struct. Comput. Sci., 2013

Monoidal computer I: Basic computability by string diagrams.
Inf. Comput., 2013

Information Security as a Resource.
Inf. Comput., 2013

Bicompletions of Distance Matrices.
Proceedings of the Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky, 2013

2012
Formalizing Physical Security Procedures.
Proceedings of the Security and Trust Management - 8th International Workshop, 2012

Quantitative Concept Analysis.
Proceedings of the Formal Concept Analysis - 10th International Conference, 2012

Actor-Network Procedures - (Extended Abstract).
Proceedings of the Distributed Computing and Internet Technology, 2012

Tracing the Man in the Middle in Monoidal Categories.
Proceedings of the Coalgebraic Methods in Computer Science - 11th International Workshop, 2012

2011
Actor-network procedures: Modeling multi-factor authentication, device pairing, social interactions
CoRR, 2011

Gaming security by obscurity.
Proceedings of the 2011 New Security Paradigms Workshop, 2011

2010
Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol.
Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics, 2010

The Unreasonable Ineffectiveness of Security Engineering: An Overview.
Proceedings of the 8th IEEE International Conference on Software Engineering and Formal Methods, 2010

Formal Derivation of Concurrent Garbage Collectors.
Proceedings of the Mathematics of Program Construction, 10th International Conference, 2010

Quantifying and Qualifying Trust: Spectral Decomposition of Trust Networks.
Proceedings of the Formal Aspects of Security and Trust - 7th International Workshop, 2010

2009
Relating Toy Models of Quantum Computation: Comprehension, Complementarity and Dagger Mix Autonomous Categories.
Proceedings of the 6th International Workshop on Quantum Physics and Logic, 2009

Quantifying pervasive authentication: the case of the Hancke-Kuhn protocol.
CoRR, 2009

Deriving Ephemeral Authentication Using Channel Axioms.
Proceedings of the Security Protocols XVII, 2009

Quantum and Classical Structures in Nondeterminstic Computation.
Proceedings of the Quantum Interaction, Third International Symposium, 2009

Geometry of abstraction in quantum computation.
Proceedings of the Classical and Quantum Information Assurance Foundations and Practice, 26.07., 2009

A Semantical Approach to Equilibria and Rationality.
Proceedings of the Algebra and Coalgebra in Computer Science, 2009

2008
On quantum statistics in data analysis
CoRR, 2008

Dynamics, Robustness and Fragility of Trust.
Proceedings of the Formal Aspects in Security and Trust, 5th International Workshop, 2008

Network as a Computer: Ranking Paths to Find Flows.
Proceedings of the Computer Science, 2008

Evolving Specification Engineering.
Proceedings of the Algebraic Methodology and Software Technology, 2008

2007
Distance Bounding Protocols: Authentication Logic Analysis and Collusion Attacks.
Proceedings of the Secure Localization and Time Synchronization for Wireless Sensor and Ad Hoc Networks, 2007

Labelled Markov Processes as Generalised Stochastic Relations.
Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

2006
Deriving Secure Network Protocols for Enterprise Services Architectures.
Proceedings of IEEE International Conference on Communications, 2006

Connector-Based Software Development: Deriving Secure Protocols.
Proceedings of the FM 2006: Formal Methods, 2006

Deriving Secrecy in Key Establishment Protocols.
Proceedings of the Computer Security, 2006

Testing Semantics: Connecting Processes and Process Logics.
Proceedings of the Algebraic Methodology and Software Technology, 2006

2005
A derivation system and compositional logic for security protocols.
J. Comput. Secur., 2005

An Encapsulated Authentication Logic for Reasoning about Key Distribution Protocols.
Proceedings of the 18th IEEE Computer Security Foundations Workshop, 2005

2004
Duality for Labelled Markov Processes.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

Deriving, Attacking and Defending the GDOI Protocol.
Proceedings of the Computer Security, 2004

Abstraction and Refinement in Protocol Derivation.
Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004

2003
A Compositional Logic for Proving Security Properties of Protocols.
J. Comput. Secur., 2003

A Derivation System for Security Protocols and its Logical Formalization.
Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW-16 2003), 30 June, 2003

Secure protocol composition.
Proceedings of the 2003 ACM workshop on Formal methods in security engineering, 2003

Colimits for Concurrent Collectors.
Proceedings of the Verification: Theory and Practice, 2003

2002
The continuum as a final coalgebra.
Theor. Comput. Sci., 2002

Software Development by Refinement.
Proceedings of the Formal Methods at the Crossroads. From Panacea to Foundational Support, 2002

Guarded Transitions in Evolving Specifications.
Proceedings of the Algebraic Methodology and Software Technology, 2002

2001
Composition and Refinement of Behavioral Specifications.
Proceedings of the 16th IEEE International Conference on Automated Software Engineering (ASE 2001), 2001

Categories of Processes Enriched in Final Coalgebras.
Proceedings of the Foundations of Software Science and Computation Structures, 2001

A Compositional Logic for Protocol Correctness.
Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14 2001), 2001

2000
Towards Semantics of Self-Adaptive Software.
Proceedings of the Self-Adaptive Software, First International Workshop, 2000

1999
Preface.
Proceedings of the Conference on Category Theory and Computer Science, 1999

On coalgebra of real numbers.
Proceedings of the Coalgebraic Methods in Computer Science, 1999

Semantics of First Order Parametric Specifications.
Proceedings of the FM'99 - Formal Methods, 1999

1998
Guarded induction on final coalgebras.
Proceedings of the First Workshop on Coalgebraic Methods in Computer Science, 1998

Calculus in Coinductive Form.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1997
Categorical logic of Names and Abstraction in Action Calculi.
Math. Struct. Comput. Sci., 1997

Chu I: Cofree Equivalences, Dualities and *-Autonomous Categories.
Math. Struct. Comput. Sci., 1997

Specifying Interaction Categories.
Proceedings of the Category Theory and Computer Science, 7th International Conference, 1997

1996
Maps II: Chasing Diagrams in Categorical Proof Theory.
Log. J. IGPL, 1996

1995
On Completeness and Cocompleteness in an Around Small Categories.
Ann. Pure Appl. Log., 1995

Convenient Category of Processes and Simulations 1: Modulo Strong Bisimilarity.
Proceedings of the Category Theory and Computer Science, 6th International Conference, 1995

1994
Categorical Logic of Concurrency and Interaction I: Synchronous Processes.
Proceedings of the Proceedings for the Second Imperial College Department of Computing Workshop on Theory and Formal Methods, 1994

1992
On the structure of paradoxes.
Arch. Math. Log., 1992

1991
Constructions and Predicates.
Proceedings of the Category Theory and Computer Science, 1991


  Loading...