Marcello M. Bonsangue

Orcid: 0000-0003-3746-3618

Affiliations:
  • Leiden Institute of Advanced Computer Science, Netherlands


According to our database1, Marcello M. Bonsangue authored at least 126 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Simulating Quantum Circuits by Model Counting.
CoRR, 2024

2023
Approximately Learning Quantum Automata.
Proceedings of the Theoretical Aspects of Software Engineering, 2023

Using a Novel Capsule Network For an Innovative Approach to Image Captioning.
Proceedings of the Workshop on Scientific Document Understanding co-located with 37th AAAI Conference on Artificial Inteligence (AAAI 2023), 2023

2022
Caps Captioning: A Modern Image Captioning Approach Based on Improved Capsule Network.
Sensors, 2022

Multi-view learning with distinguishable feature fusion for rumor detection.
Knowl. Based Syst., 2022

From symbolic constraint automata to Promela.
J. Log. Algebraic Methods Program., 2022

Multi-scale graph capsule with influence attention for information cascades prediction.
Int. J. Intell. Syst., 2022

A Language-Based Causal Model for Safety.
Proceedings of the Theoretical Aspects of Software Engineering, 2022

Non-linear Optimization Methods for Learning Regular Distributions.
Proceedings of the Formal Methods and Software Engineering, 2022

2021
Catch me if you can: A participant-level rumor detection framework via fine-grained user representation learning.
Inf. Process. Manag., 2021

Modeling microscopic and macroscopic information diffusion for rumor detection.
Int. J. Intell. Syst., 2021

Symbolic execution formally explained.
Formal Aspects Comput., 2021

Learning Probabilistic Automata Using Residuals.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2021, 2021

Automatic Human-Like Detection of Code Smells.
Proceedings of the Discovery Science - 24th International Conference, 2021

2020
SymPaths: Symbolic Execution Meets Partial Order Reduction.
Proceedings of the Deductive Software Verification: Future Perspectives, 2020

Modeling and verifying the topology discovery mechanism of OpenFlow controllers in software-defined networks using process algebra.
Sci. Comput. Program., 2020

Minimisation in Logical Form.
CoRR, 2020

Learning Probabilistic Languages by k-Testable Machines.
Proceedings of the International Symposium on Theoretical Aspects of Software Engineering, 2020

2019
Model Checking Longitudinal Control in Vehicle Platoon Systems.
IEEE Access, 2019

Completeness and Incompleteness of Synchronous Kleene Algebra.
Proceedings of the Mathematics of Program Construction - 13th International Conference, 2019

PDNet: A Programming Language for Software-Defined Networks with VLAN.
Proceedings of the Formal Methods and Software Engineering, 2019

A Reo Model of Software Defined Networks.
Proceedings of the Formal Methods and Software Engineering, 2019

On the Nature of Symbolic Execution.
Proceedings of the Formal Methods - The Next 30 Years - Third World Congress, 2019

2018
Preface for the special issue of the 10th International Symposium on Theoretical Aspects of Software Engineering (TASE 2016).
Sci. Comput. Program., 2018

2017
Enhanced coalgebraic bisimulation.
Math. Struct. Comput. Sci., 2017

Foundations.
Proceedings of the Enterprise Architecture at Work, 2017

A Language for Enterprise Modelling.
Proceedings of the Enterprise Architecture at Work, 2017


2016
A coalgebraic view on decorated traces.
Math. Struct. Comput. Sci., 2016

Structural congruence for bialgebraic semantics.
J. Log. Algebraic Methods Program., 2016

Proving language inclusion and equivalence by coinduction.
Inf. Comput., 2016

Duality of Equations and Coequations via Contravariant Adjunctions.
Proceedings of the Coalgebraic Methods in Computer Science, 2016

Action Systems for Pharmacokinetic Modeling.
Proceedings of the From Action Systems to Distributed Systems - The Refinement Approach., 2016

2015
Preface.
Theor. Comput. Sci., 2015

It is pointless to point in bounded heaps.
Sci. Comput. Program., 2015

Model checking recursive programs interacting via the heap.
Sci. Comput. Program., 2015

Context-free coalgebras.
J. Comput. Syst. Sci., 2015

Presenting Distributive Laws.
Log. Methods Comput. Sci., 2015

Regular Varieties of Automata and Coequations.
Proceedings of the Mathematics of Program Construction - 12th International Conference, 2015

Equations and Coequations for Weighted Automata.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014
Algebra-coalgebra duality in Brzozowski's minimization algorithm.
ACM Trans. Comput. Log., 2014

Monitoring method call sequences using annotations.
Sci. Comput. Program., 2014

Coalgebraic Semantics of Heavy-Weighted Automata.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2014

Integrating Testing into Agile Software Development Processes.
Proceedings of the MODELSWARD 2014 - Proceedings of the 2nd International Conference on Model-Driven Engineering and Software Development, Lisbon, Portugal, 7, 2014

A Coalgebraic Foundation for Coinductive Union Types.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Combining Bialgebraic Semantics and Equations.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

(Co)Algebraic Characterizations of Signal Flow Graphs.
Proceedings of the Horizons of the Mind. A Tribute to Prakash Panangaden, 2014

2013
Sound and Complete Axiomatizations of Coalgebraic Language Equivalence.
ACM Trans. Comput. Log., 2013

Automatic equivalence proofs for non-deterministic coalgebras.
Sci. Comput. Program., 2013

Rational Operational Models.
Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, 2013

Generalizing determinization from automata to coalgebras
Log. Methods Comput. Sci., 2013

Coalgebraic Characterizations of Context-Free Languages.
Log. Methods Comput. Sci., 2013

Coalgebraic Bisimulation-Up-To.
Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

Coinductive Proof Techniques for Language Equivalence.
Proceedings of the Language and Automata Theory and Applications, 2013

Unbounded Allocation in Bounded Heaps.
Proceedings of the Fundamentals of Software Engineering - 5th International Conference, 2013

2012
A model of context-dependent component connectors.
Sci. Comput. Program., 2012

A coalgebraic perspective on linear weighted automata.
Inf. Comput., 2012

Final Semantics for Decorated Traces.
Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012

Interacting via the Heap in the Presence of Recursion
Proceedings of the Proceedings Fifth Interaction and Concurrency Experience, 2012

On the specification of operations on the rational behaviour of systems
Proceedings of the Proceedings Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics, 2012

Bounded Model Checking of Recursive Programs with Pointers in K.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2012

Defining Context-Free Power Series Coalgebraically.
Proceedings of the Coalgebraic Methods in Computer Science - 11th International Workshop, 2012

Automated Verification of Recursive Programs with Pointers.
Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

Brzozowski's Algorithm (Co)Algebraically.
Proceedings of the Logic and Program Semantics, 2012

2011
Büchi automata for modeling component connectors.
Softw. Syst. Model., 2011

Quantitative Kleene coalgebras.
Inf. Comput., 2011

Context-Free Languages, Coalgebraically.
Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2010
Non-Deterministic Kleene Coalgebras
Log. Methods Comput. Sci., 2010

A Decision Procedure for Bisimilarity of Generalized Regular Expressions.
Proceedings of the Formal Methods: Foundations and Applications, 2010

Generalizing the powerset construction, coalgebraically.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Decomposition of Constraint Automata.
Proceedings of the Formal Aspects of Component Software - 7th International Workshop, 2010

Monitoring Method Call Sequences Using Annotations.
Proceedings of the Formal Aspects of Component Software - 7th International Workshop, 2010

2009
Preface.
Theor. Comput. Sci., 2009

An Algebra for Kripke Polynomial Coalgebras.
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

Automata Based Model Checking for Reo Connectors.
Proceedings of the Fundamentals of Software Engineering, 2009

A Kleene Theorem for Polynomial Coalgebras.
Proceedings of the Foundations of Software Science and Computational Structures, 2009

Automata for Context-Dependent Connectors.
Proceedings of the Coordination Models and Languages, 11th International Conference, 2009

Deriving Syntax and Axioms for Quantitative Regular Behaviours.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
Java Test Driver Generation from Object-Oriented Interaction Traces.
Proceedings of the 2nd International Workshop on Harnessing Theories for Tool Support in Software, 2008

Modeling Component Connectors: Synchronisation and Context-Dependency.
Proceedings of the Sixth IEEE International Conference on Software Engineering and Formal Methods, 2008

Recasting Constraint Automata into Büchi Automata.
Proceedings of the Theoretical Aspects of Computing, 2008

Coalgebraic Logic and Synthesis of Mealy Machines.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

2007
Integrating Architectural Models - Symbolic, Semantic and Subjective Models in Enterprise Architecture.
Enterp. Model. Inf. Syst. Archit. Int. J. Concept. Model., 2007

Pi-Calculus in Logical Form.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

2006
A Component Coordination Model Based on Mobile Channels.
Fundam. Informaticae, 2006

Presenting Functors by Operations and Equations.
Proceedings of the Foundations of Software Science and Computation Structures, 2006

2005
Modeling the Exogenous Coordination of Mobile Channel-based Systems with Petri Nets.
Proceedings of the 4th International Workshop on the Foundations of Coordination Languages and Software Architectures, 2005

MoCha-pi, an exogenous coordination calculus based on mobile channels.
Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

Change impact analysis of enterprise architectures.
Proceedings of the 2005 IEEE International Conference on Information Reuse and Integration, 2005

Enterprise Architecture Analysis with XML.
Proceedings of the 38th Hawaii International Conference on System Sciences (HICSS-38 2005), 2005

Duality for Logics of Transition Systems.
Proceedings of the Foundations of Software Science and Computational Structures, 2005

2004
Concepts For Modeling Enterprise Architectures.
Int. J. Cooperative Inf. Syst., 2004

Using XML Transformations for Enterprise Architectures.
Proceedings of the Leveraging Applications of Formal Methods, 2004

Object Connectivity and Full Abstraction for a Concurrent Calculus of Classes.
Proceedings of the Theoretical Aspects of Computing, 2004

A Fully Abstract Semantics for UML Components.
Proceedings of the Formal Methods for Components and Objects, 2004

Observability, Connectivity, and Replay in a Sequential Calculus of Classes.
Proceedings of the Formal Methods for Components and Objects, 2004

A Logical Viewpoint on Architectures.
Proceedings of the 8th International Enterprise Distributed Object Computing Conference (EDOC 2004), 2004

2003
Comparing coordination models and architectures using embeddings.
Sci. Comput. Program., 2003

Infinite intersection types.
Inf. Comput., 2003

Investigating the mapping of an Enterprise Description Language into UML 2.0.
Proceedings of the Workshop on the Compositional Verification of UML Models, 2003

Preface.
Proceedings of the Workshop on the Compositional Verification of UML Models, 2003


2002
Mobile Channels, Implementation Within and Outside Components.
Proceedings of the Formal Methods and Component Interaction 2002, 2002

A Channel-based Coordination Model for Components.
Proceedings of the Foundations of Coordination Languages and Software Architectures, 2002

MoCha: A Middleware Based on Mobile Channels.
Proceedings of the 26th International Computer Software and Applications Conference (COMPSAC 2002), 2002

2001
Infinite Intersection and Union Types for the Lazy Lambda Calculus.
Proceedings of the Theoretical Aspects of Computer Software, 4th International Symposium, 2001

2000
A transition system semantics for the control-driven coordination language MANIFOLD.
Theor. Comput. Sci., 2000

A Coordination Lanuage for Mobile Components.
Proceedings of the Applied Computing 2000, 2000

A Compositional Model for Confluent Dynamic Data-Flow Networks.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

A Logical Interface Description Language for Components.
Proceedings of the Coordination Languages and Models, 4th International Conference, 2000

1999
Toward an Infinitary Logic of Domains: Abramsky Logic for Transition Systems.
Inf. Comput., 1999

Comparing Coordination Models Based on Shared Distributed Replicated Data.
Proceedings of the 1999 ACM Symposium on Applied Computing, 1999

Developing Object-based Distributed Systems.
Proceedings of the Formal Methods for Open Object-Based Distributed Systems, 1999

Comparing Software Architectures for Coordination Languages.
Proceedings of the Coordination Languages and Models, Third International Conference, 1999

1998
Generalized Metric Spaces: Completion, Topology, and Powerdomains via the Yoneda Embedding.
Theor. Comput. Sci., 1998

Topological Duality in Semantics.
Electronic Notes in Theoretical Computer Science 8, 1998

A software architecture for distributed control systems and its transition system semantics.
Proceedings of the 1998 ACM symposium on Applied Computing, 1998

An Approach to Object-Orientation in Action Systems.
Proceedings of the Mathematics of Program Construction, 1998

1997
Infinitary Domain Logic for Finitary Transition Systems.
Proceedings of the Theoretical Aspects of Computer Software, Third International Symposium, 1997

Specifying Computations Using Hyper Transition Systems.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

1995
Duality Beyond Sober Spaces: Topological Spaces and Observation Frames.
Theor. Comput. Sci., 1995

Metric Predicate Transformers: Towards a Notion of Refinement for Concurrency.
Proceedings of the CONCUR '95: Concurrency Theory, 1995

1994
The Weakest Precondition Calculus: Recursion and Duality.
Formal Aspects Comput., 1994

Relating Multifunctions and Predicate Transformers through Closure Operators.
Proceedings of the Theoretical Aspects of Computer Software, 1994

1993
Isomorphisms between Predicates and State Transformers.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992
Semantics, Orderings and Recursion in the Weakest Precondition Calculus.
Proceedings of the Sematics: Foundations and Applications, 1992


  Loading...