Latest

• A simple criterion for M,N-adhesivity
• Behavioral equivalences for AbU: Verifying security and safety in distributed IoT systems
• ECC's Achilles'Heel: Unveiling Weak Keys in Standardized Curves
• Netstaldi: A Modular Distributed Architecture for Incremental Network Discovery
• AbU: A calculus for distributed event-driven programming with attribute-based interaction
• Assembling Coherent Network Topologies Using Round-Trip Graphs (short paper)
• Automated verification of Telegram’s MTProto 2.0 in the symbolic model
• DBCChecker: A Bigraph-Based Tool for Checking Security Properties of Container Compositions
• Modeling Carne PRI supply chain with the *-Chain Platform
• Pairing an Autoencoder and a SF-SOINN for Implementing an Intrusion Detection System
• A Calculus for Subjective Communication
• A new criterion for M,N-adhesivity, with an application to hierarchical graphs
• Composable partial multiparty session types for open systems
• Computing (optimal) embeddings of directed bigraphs
• Distributed Programming of Smart Systems with Event-Condition-Action Rules
• Fuzzy Algebraic Theories
• The AbU Language: IoT Distributed Programming Made Easy
• A Calculus for Attribute-Based Memory Updates
• A time-series classification approach to shallow web traffic de-anonymization
• Automated symbolic verification of Telegram’s MTProto 2.0
• Closure hyperdoctrines
• Composable Partial Multiparty Session Types
• On the Security and Safety of AbU Systems
• Computing Embeddings of Directed Bigraphs
• Securing the art market with distributed public ledgers
• Software transactional memory with interactions
• Towards a formal model for composable container systems
• An abstract distributed middleware for transactions over heterogeneous stores
• Towards user recognition by shallow web traffic inspection
• Constructive logical characterizations of bisimilarity for reactive probabilistic systems
• Deciding hedged bisimilarity
• Guest editors' foreword
• Loose Graph Simulations
• Deciding weak weighted bisimulation
• Preface
• Disjunctive Probabilistic Modal Logic is Enough for Bisimilarity on Reactive Probabilistic Systems
• On the bisimulation hierarchy of state-to-function transition systems
• Special Issue on Methodologies, Technologies and Tools Enabling e-Government
• Structural operational semantics for non-deterministic processes with quantitative aspects
• Behavioural equivalences for coalgebras with unobservable moves
• Distributed execution of bigraphical reactive systems
• Open transactions on shared memory
• Structural operational semantics for continuous state stochastic transition systems
• A CSP implementation of the bigraph embedding problem
• A Model of Countable Nondeterminism in Guarded Type Theory
• Finding a Forest in a Tree - The matching problem for wide reactive systems
• GSOS for non-deterministic processes with quantitative aspects
• MeTTeG14, Proceedings of the 8th International Conference on Methodologies, Technologies and Tools Enabling e-Government
• Multi-agent Systems Design and Prototyping with Bigraphical Reactive Systems
• Structural operational semantics for non-deterministic processes with quantitative aspects
• Towards distributed bigraphical reactive systems
• Weak bisimulations for labelled transition systems weighted over semirings
• Implementing the Stochastics Brane Calculus in a Generic Stochastic Abstract Machine
• Measurable Stochastics for Brane Calculus
• Structural operational semantics for continuous state probabilistic processes
• Synthesis of distributed mobile programs using monadic types in Coq
• Formal analysis of Facebook Connect Single Sign-On authentication protocol
• Unobservable intrusion detection based on call traces in paravirtualized systems
• Graph Algebras for Bigraphs
• LFMTP 2010 - Preface
• Measurable Stochastics for Brane Calculus
• Proceedings 5th International Workshop on Logical Frameworks and Meta-languages: Theory and Practice
• A framework for protein and membrane interactions
• Bigraphical models for protein and membrane interactions
• DBtk: A Toolkit for Directed Bigraphs
• Deriving Barbed Bisimulations for Bigraphical Reactive Systems
• A categorical model of the Fusion calculus
• An Algebra for Directed Bigraphs
• Controlling resource access in Directed Bigraphs
• Implementing Spi Calculus using Nominal techniques
• Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface
• PicNIc - Pi-calculus Non-Interference checker
• Types for Proofs and Programs International Conference, TYPES 2007, Revised Selected Papers
• Undecidability of Model Checking in Brane Logic
• Directed Bigraphs
• Reactive Systems over Directed Bigraphs
• Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts
• About permutation algebras, (pre)sheaves and named sets
• Consistency of the Theory of Contexts
• Implementazione di Memoria Distribuita su cluster CompactPCI
• Modal logics for Brane Calculus
• A unifying model of variables and names
• Translating Specifications from Nominal Logic to CIC with the Theory of Contexts
• Modeling fresh names in the π-calculus using abstractions
• Proceedings of COMETA 2003
• Proceedings of the Workshop COMETA Computational Metamodels
• Some characterization results for permutation algebras
• Unifying Recursive and Co-recursive Definitions in Sheaf Categories
• A Framework for Typed HOAS and Semantics
• A Unifying Approach to Recursive and Co-recursive Definitions
• Imperative Object-based Calculi in (Co)Inductive Type Theories
• MERLIN '03 Mechanized Reasoning about Languages with Variable Binding 2003 Wokshop (co-located with ICFP and PPDP 2003 Conferences)
• Reasoning on an Imperative Object-based Calculus in Higher Order Abstract Syntax
• Special Issue of Theoretical Computer Science on FOSSACS 2001
• Theoretical Computer Science: Preface
• Ambient Calculus and its Logic in the Calculus of Inductive Constructions
• Comparing Higher-Order Encodings in Logical Frameworks and Tile Logic
• Frecuencis lessicâls dal furlan scrit
• TOSCA 2001
• An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS
• Developing (Meta)Theory of lambda-calculus in the Theory of Contexts
• On the formalization of the modal mu-calculus in the calculus of inductive constructions
• pi-calculus in (Co)Inductive Type Theories
• Proceedings of FOSSACS 2001
• The Theory of Contexts for First Order and Higher Order Abstract Syntax
• Formalizing a lazy substitution proof system for μ-calculus in the Calculus of Inductive Constructions
• Encoding Modal Logics in Logical Frameworks
• Encoding logical theories of programs
• A natural deduction approach to dynamic logic
• Modal μ-types for processes
• The expressive power of structural operational semantics with explicit assumptions