Marino Miculan

Orcid: 0000-0003-0755-3444

Affiliations:
  • University of Udine, Italy


According to our database1, Marino Miculan authored at least 97 papers between 1993 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A simple criterion for M,N-adhesivity.
Theor. Comput. Sci., January, 2024

On The Axioms Of M, N-Adhesive Categories.
CoRR, 2024

2023
AbU: A calculus for distributed event-driven programming with attribute-based interaction.
Theor. Comput. Sci., May, 2023

Composable partial multiparty session types for open systems.
Softw. Syst. Model., April, 2023

Automated verification of Telegram's MTProto 2.0 in the symbolic model.
Comput. Secur., March, 2023

DBCChecker: a Bigraph-based Tool for Checking Security Properties of Container Compositions.
Proceedings of the Italian Conference on Cyber Security (ITASEC 2023), 2023

Pairing an Autoencoder and a SF-SOINN for Implementing an Intrusion Detection System.
Proceedings of the Italia Intelligenza Artificiale, 2023

Assembling Coherent Network Topologies Using Round-Trip Graphs (short paper).
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

Modeling Carne PRI supply chain with the *-Chain Platform.
Proceedings of the Fifth Distributed Ledger Technology Workshop (DLT 2023), 2023

2022
Computing (optimal) embeddings of directed bigraphs.
Sci. Comput. Program., 2022

A new criterion for M, N-adhesivity, with an application to hierarchical graphs.
CoRR, 2022

The AbU Language: IoT Distributed Programming Made Easy.
IEEE Access, 2022

Distributed Programming of Smart Systems with Event-Condition-Action Rules.
Proceedings of the 23rd Italian Conference on Theoretical Computer Science, 2022

A Calculus for Subjective Communication.
Proceedings of the 23rd Italian Conference on Theoretical Computer Science, 2022

A new criterion for <i>M</i>, <i>N</i>-adhesivity, with an application to hierarchical graphs.
Proceedings of the Foundations of Software Science and Computation Structures, 2022

Fuzzy Algebraic Theories.
Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

2021
On the Security and Safety of AbU Systems.
Proceedings of the Software Engineering and Formal Methods - 19th International Conference, 2021

Automated Symbolic Verification of Telegram's MTProto 2.0.
Proceedings of the 18th International Conference on Security and Cryptography, 2021

A Time-series Classification Approach to Shallow Web Traffic De-anonymization.
Proceedings of the Italian Conference on Cybersecurity, 2021

A Calculus for Attribute-Based Memory Updates.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2021, 2021

Composable Partial Multiparty Session Types.
Proceedings of the Formal Aspects of Component Software - 17th International Conference, 2021

Closure Hyperdoctrines.
Proceedings of the 9th Conference on Algebra and Coalgebra in Computer Science, 2021

2020
Closure hyperdoctrines, with paths.
CoRR, 2020

A CSP implementation of the directed bigraph embedding problem.
CoRR, 2020

Towards a formal model for composable container systems.
Proceedings of the SAC '20: The 35th ACM/SIGAPP Symposium on Applied Computing, online event, [Brno, Czech Republic], March 30, 2020

Securing the Art Market with Distributed Public Ledgers.
Proceedings of the 3rd Distributed Ledger Technology Workshop Co-located with ITASEC 2020, 2020

Software Transactional Memory with Interactions.
Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

Computing Embeddings of Directed Bigraphs.
Proceedings of the Graph Transformation - 13th International Conference, 2020

2019
Constructive logical characterizations of bisimilarity for reactive probabilistic systems.
Theor. Comput. Sci., 2019

Towards User Recognition by Shallow Web Traffic Inspection.
Proceedings of the Third Italian Conference on Cyber Security, 2019

An Abstract Distributed Middleware for Transactions over Heterogeneous Stores.
Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

2018
Guest editors' foreword.
J. Log. Algebraic Methods Program., 2018

Deciding Hedged Bisimilarity.
Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

2017
Reductions for Transition Systems at Work: Deriving a Logical Characterization of Quantitative Bisimulation.
CoRR, 2017

Loose Graph Simulations.
Proceedings of the Software Technologies: Applications and Foundations, 2017

Deciding Weak Weighted Bisimulation.
Proceedings of the Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), 2017

2016
Structural operational semantics for non-deterministic processes with quantitative aspects.
Theor. Comput. Sci., 2016

A Specification of Open Transactional Memory for Haskell.
CoRR, 2016

On the Bisimulation Hierarchy of State-to-Function Transition Systems.
Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

Disjunctive Probabilistic Modal Logic is Enough for Bisimilarity on Reactive Probabilistic Systems.
Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

2015
Behavioural equivalences for coalgebras with unobservable moves.
J. Log. Algebraic Methods Program., 2015

Structural operational semantics for continuous state stochastic transition systems.
J. Comput. Syst. Sci., 2015

Open Transactions on Shared Memory.
Proceedings of the Coordination Models and Languages, 2015

2014
Distributed execution of bigraphical reactive systems.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2014

A CSP implementation of the bigraph embedding problem.
CoRR, 2014

GSOS for non-deterministic processes with quantitative aspects.
Proceedings of the Proceedings Twelfth International Workshop on Quantitative Aspects of Programming Languages and Systems, 2014

Finding a Forest in a Tree - The Matching Problem for Wide Reactive Systems.
Proceedings of the Trustworthy Global Computing - 9th International Symposium, 2014

A Model of Countable Nondeterminism in Guarded Type Theory.
Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

Multi-agent Systems Design and Prototyping with Bigraphical Reactive Systems.
Proceedings of the Distributed Applications and Interoperable Systems, 2014

2013
Weak bisimulations for labelled transition systems weighted over semirings.
CoRR, 2013

2012
Measurable stochastics for Brane Calculus.
Theor. Comput. Sci., 2012

Implementing the Stochastics Brane Calculus in a Generic Stochastic Abstract Machine
Proceedings of the Proceedings 6th Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2012

Synthesis of Distributed Mobile Programs Using Monadic Types in Coq.
Proceedings of the Interactive Theorem Proving - Third International Conference, 2012

Structural Operational Semantics for Continuous State Probabilistic Processes.
Proceedings of the Coalgebraic Methods in Computer Science - 11th International Workshop, 2012

2011
Unobservable Intrusion Detection based on Call Traces in Paravirtualized Systems.
Proceedings of the SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography, Seville, Spain, 18, 2011

2010
Graph Algebras for Bigraphs.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010

2009
A framework for protein and membrane interactions
Proceedings of the Proceedings Third Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2009

Bigraphical models for protein and membrane interactions
Proceedings of the Proceedings Third Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2009

DBtk: A Toolkit for Directed Bigraphs.
Proceedings of the Algebra and Coalgebra in Computer Science, 2009

2008
A Categorical Model of the Fusion Calculus.
Proceedings of the 24th Conference on the Mathematical Foundations of Programming Semantics, 2008

Deriving Barbed Bisimulations for Bigraphical Reactive Systems.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2008

Controlling resource access in Directed Bigraphs.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2008

Implementing Spi Calculus Using Nominal Techniques.
Proceedings of the Logic and Theory of Algorithms, 2008

PicNIc - Pi-calculus non-interference checker.
Proceedings of the 8th International Conference on Application of Concurrency to System Design (ACSD 2008), 2008

2007
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts.
J. Autom. Reason., 2007

An Algebra for Directed Bigraphs.
Proceedings of the Fourth International Workshop on Computing with Terms and Graphs, 2007

Directed Bigraphs.
Proceedings of the 23rd Conference on the Mathematical Foundations of Programming Semantics, 2007

Undecidability of Model Checking in Brane Logic.
Proceedings of the Third International Workshop on Developments in Computational Models, 2007

Reactive Systems over Directed Bigraphs.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006
About permutation algebras, (pre)sheaves and named sets.
High. Order Symb. Comput., 2006

Consistency of the theory of contexts.
J. Funct. Program., 2006

Modal Logics for Brane Calculus.
Proceedings of the Computational Methods in Systems Biology, International Conference, 2006

2005
Translating specifications from nominal logic to CIC with the theory of contexts.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2005

A Unifying Model of Variables and Names.
Proceedings of the Foundations of Software Science and Computational Structures, 2005

2004
Modeling Fresh Names in the ?-calculus Using Abstractions.
Proceedings of the Workshop on Coalgebraic Methods in Computer Science, 2004

Unifying Recursive and Co-recursive Definitions in Sheaf Categories.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

2003
Preface.
Proceedings of the Workshop of the COMETA Project on Computational Metamodels, 2003

Some Characterization Results for Permutation Algebras.
Proceedings of the Workshop of the COMETA Project on Computational Metamodels, 2003

A framework for typed HOAS and semantics.
Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2003

Imperative Object-Based Calculi in Co-inductive Type Theories.
Proceedings of the Logic for Programming, 2003

Reasoning on an imperative object-based calculus in Higher Order Abstract Syntax.
Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, 2003

2002
Ambient Calculus and its Logic in the Calculus of Inductive Constructions.
Proceedings of the International Workshop on Logical Frameworks and Meta-Languages, 2002

A Unifying Approach to Recursive and Co-recursive Definitions.
Proceedings of the Types for Proofs and Programs, Second International Workshop, 2002

2001
Developing (Meta)Theory of Lambda-calculus in the Theory of Context.
Proceedings of the Mechanized Reasoning about Languages with Variable Binding, 2001

pi-calculus in (Co)inductive-type theory.
Theor. Comput. Sci., 2001

On the Formalization of the Modal µ-Calculus in the Calculus of Inductive Constructions.
Inf. Comput., 2001

Preface.
Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001

The Theory of Contexts for First Order and Higher Order Abstract Syntax.
Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001

Comparing Higher-Order Encodings in Logical Frameworks and Tile Logic.
Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001

An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

1999
The Journal of High Energy Physics: Scientific Publishing on the Web.
Proceedings of WebNet 99, 1999

Formalizing a Lazy Substitution Proof System for µ-calculus in the Calculus of Inductive Constructions.
Proceedings of the Automata, 1999

1998
Encoding Modal Logics in Logical Frameworks.
Stud Logica, 1998

A Natural Deduction style proof system for propositional μ-calculus and its formalization in inductive type theories
CoRR, 1998

1995
A Natural Deduction Approach to Dynamic Logic.
Proceedings of the Types for Proofs and Programs, 1995

Modal mu-Types for Processes
Proceedings of the Proceedings, 1995

1993
The Expressive Power of Structural Operational Semantics with Explicit Assumptions.
Proceedings of the Types for Proofs and Programs, 1993


  Loading...