样式: 排序: IF: - GO 导出 标记为已读
-
Coherent modal transition systems refinement J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2024-02-28 Davide Basile, Maurice H. ter Beek, Alessandro Fantechi, Stefania Gnesi
Modal Transition Systems (MTS) are a well-known formalism that extend Labelled Transition Systems (LTS) with the possibility of specifying necessary and permitted behaviour. Coherent MTS (CMTS) have been introduced to model Software Product Lines (SPL) based on a correspondence between the necessary and permitted modalities of MTS transitions and their associated actions, and the core and optional
-
Verification of data-aware process models: Checking soundness of data Petri nets J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2024-02-07 Nikolai M. Suvorov, Irina A. Lomazova
During recent years, significant research has been done in the direction of enriching the traditional control-flow perspective of processes with additional dimensions, such as data and decisions. To represent data-aware process models, various formalisms have been proposed. In this work, we focus on Data Petri nets (DPNs), an extension to a Petri net with data. Data in a DPN is set as variable values
-
-
Reversible debugging of concurrent Erlang programs: Supporting imperative primitives J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2024-01-17 Pietro Lami, Ivan Lanese, Jean-Bernard Stefani, Claudio Sacerdoti Coen, Giovanni Fabbretti
Reversible computing is a programming paradigm allowing one to execute programs both in the standard, forward direction as well as backwards, recovering past states. A relevant application of reversible computing is causal-consistent reversible debugging, which allows one to explore concurrent computations backwards and forwards to find a bug. The basic idea is that any action can be undone, provided
-
Trace preservation in B and Event-B refinements J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2024-01-05 Sebastian Stock, Atif Mashkoor, Michael Leuschel, Alexander Egyed
Refinement guarantees that the concrete version of a model does not violate the constraints introduced at the abstract level. The peculiarity of refinement, however, is that we have no guarantee about the preservation of the behavior of the model. For example, a trace (a set of desirable states and transitions) created on the abstract model may not replay on the concrete model. Its manual recreation
-
Formally verified animation for RoboChart using interaction trees J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-12-28 Kangfeng Ye, Simon Foster, Jim Woodcock
RoboChart is a core notation in the RoboStar framework. It is a timed and probabilistic domain-specific and state machine-based language for robotics. RoboChart supports shared variables and communication across entities in its component model. It has formal denotational semantics given in CSP. The semantic technique of Interaction Trees (ITrees) represents behaviours of reactive and concurrent programs
-
Bridging formal methods and machine learning with model checking and global optimisation J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-12-28 Saddek Bensalem, Xiaowei Huang, Wenjie Ruan, Qiyi Tang, Changshun Wu, Xingyu Zhao
Formal methods and machine learning are two research fields with drastically different foundations and philosophies. Formal methods utilise mathematically rigorous techniques for software and hardware systems' specification, development and verification. Machine learning focuses on pragmatic approaches to gradually improve a parameterised model by observing a training data set. While historically,
-
Protocol choice and iteration for the free cornering J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-12-29 Chad Nester, Niels Voorneveld
We extend the free cornering of a symmetric monoidal category, a double categorical model of concurrent interaction, to support branching communication protocols and iterated communication protocols. We validate our constructions by showing that they inherit significant categorical structure from the free cornering, including that they form monoidal double categories. We also establish some elementary
-
On proving that an unsafe controller is not proven safe J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-12-19 Yuvaraj Selvaraj, Jonas Krook, Wolfgang Ahrendt, Martin Fabian
Cyber-physical systems are often safety-critical and their correctness is crucial, such as in the case of automated driving. Using formal mathematical methods is one way to guarantee correctness and improve safety. Although these methods have shown their usefulness, care must be taken because modelling errors might result in proving a faulty controller safe, which is potentially catastrophic in practice
-
Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-12-01 Sven Schneider, Maria Maximova, Holger Giese
Cyber-physical systems often encompass complex concurrent behavior with timing constraints and probabilistic failures on demand. The analysis whether such systems with probabilistic timed behavior adhere to a given specification is essential. The formalism of Interval Probabilistic Timed Graph Transformation Systems (IPTGTSs) is often a suitable choice to model cyber-physical systems because (a) its
-
Back to the format: A survey on SOS for probabilistic processes J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-11-13 Valentina Castiglioni, Ruggero Lanotte, Simone Tini
In probabilistic process algebras the classic qualitative description of process behaviour is enriched with quantitative information on it, usually modelled in terms of probabilistic weights and/or distributions over the qualitative behaviour. In this setting, we use behavioural equivalences to check whether two processes show exactly the same behaviour, and, if this is not the case, we can use behavioural
-
Business processes resource management using rewriting logic and deep-learning-based predictive monitoring J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-11-07 Francisco Durán, Nicolás Pozas, Camilo Rocha
A significant task in business process optimization is concerned with streamlining the allocation and sharing of resources. This paper presents an approach for analyzing business process provisioning under a resource prediction strategy based on deep learning. A timed and probabilistic rewrite theory specification formalizes the semantics of business processes. It is integrated with an external oracle
-
Time distance-based computation of the DBM over-approximation of preemptive real-time systems J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-11-04 Abdelkrim Abdelli
The verification of preemptive real-time systems is a crucial aspect in ensuring their correctness and reliability to meet strict time constraints. Generally, the analysis of the behaviors of such systems requires the computation of the reachability graphs encoding their state space. However, the construction of the latter is computationally expensive and resource-consuming as it involves, for each
-
Local confluence of conditional and generalized term rewriting systems J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-10-31 Salvador Lucas
Reduction-based systems are used as a basis for the implementation of programming languages, automated reasoning systems, mathematical analysis tools, etc. In such inherently non-deterministic systems, guaranteeing that diverging steps can be eventually rejoined is crucial for a faithful use in most applications. This property of reduction systems is called local confluence. In a landmark 1980 paper
-
Quantum encoding of dynamic directed graphs J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-10-27 D. Della Giustina, C. Londero, C. Piazza, B. Riccardi, R. Romanello
In application domains such as routing, network analysis, scheduling, and planning, directed graphs are widely used as both formal models and core data structures for the development of efficient algorithmic solutions. In these areas, graphs are often evolving in time: for example, connection links may fail due to temporary technical issues, meaning that edges of the graph cannot be traversed for some
-
Certifying expressive power and algorithms of reversible primitive permutations with Lean J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-10-23 Giacomo Maletto, Luca Roversi
Reversible primitive permutations (RPP) is a class of recursive functions that models reversible computation. We present a proof, which has been verified using the proof-assistant Lean, that demonstrates RPP can encode every primitive recursive function (PRF-completeness) and that each RPP can be encoded as a primitive recursive function (PRF-soundness). Our proof of PRF-completeness is simpler and
-
The correctness of concurrencies in (reversible) concurrent calculi J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-10-20 Clément Aubert
This article designs a general principle to check the correctness of the definition of concurrency (a.k.a. independence) of events for concurrent calculi. Concurrency relations are central in process algebras, but also two-sided: they are often defined independently on composable and on coinitial transitions, and no criteria exist to assess whether they “interact correctly”. This article starts by
-
Control-data separation and logical condition propagation for efficient inference on probabilistic programs J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-10-05 Ichiro Hasuo, Yuichiro Oyabu, Clovis Eberhart, Kohei Suenaga, Kenta Cho, Shin-ya Katsumata
We present a novel sampling framework for probabilistic programs. The framework combines two recent ideas—control-data separation and logical condition propagation—in a nontrivial manner so that the two ideas boost the benefits of each other. We implemented our algorithm on top of Anglican. The experimental results demonstrate our algorithm's efficiency, especially for programs with while loops and
-
A dynamic logic with branching modalities J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-10-02 Yuanrui Zhang, Zhiming Liu
We propose a dynamic logic DLb called “dynamic logic with branching modalities”, which extends the temporal dynamic logic DLT with a “branching modality” for specifying safety properties of regular programs with tests (simply “regular programs”). Compared to the trace modality of DLT for while programs that do not abort, branching modality of DLb does not exclude aborting traces introduced by regular
-
Branching pomsets: Design, expressiveness and applications to choreographies J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-09-20 Luc Edixhoven, Sung-Shik Jongmans, José Proença, Ilaria Castellani
Choreographic languages describe possible sequences of interactions among a set of agents. Typical models are based on languages or automata over sending and receiving actions. Pomsets provide a more compact alternative by using a partial order to explicitly represent causality and concurrency between these actions. However, pomsets offer no representation of choices, thus a set of pomsets is required
-
A generic construction for crossovers of graph-like structures and its realization in the Eclipse Modeling Framework J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-09-09 Jens Kosiol, Stefan John, Gabriele Taentzer
In model-driven optimization (MDO), domain-specific models are used to define and solve optimization problems via meta-heuristic search, often via evolutionary algorithms. Models are typically evolved using mutations, which can be formally specified as graph transformations. So far, only mutations have been used to generate new solution models from existing ones; a crossover mechanism has not yet been
-
Weighted automata extraction and explanation of recurrent neural networks for natural language tasks J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-09-06 Zeming Wei, Xiyue Zhang, Yihao Zhang, Meng Sun
Recurrent Neural Networks (RNNs) have achieved tremendous success in processing sequential data, yet understanding and analyzing their behaviours remains a significant challenge. To this end, many efforts have been made to extract finite automata from RNNs, which are more amenable for analysis and explanation. However, existing approaches like exact learning and compositional approaches for model extraction
-
On algebraic array theories J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-09-01 Rodrigo Raya, Viktor Kunčak
Automatic verification of programs manipulating arrays relies on specialised decision procedures. A methodology to classify the theories handled by these procedures is introduced. It is based on decomposition theorems in the style of Feferman and Vaught. The method is applied to obtain an extension of combinatory array logic that is closed under propositional operations and Hoare triples. A classification
-
Program equivalence in a typed probabilistic call-by-need functional language J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-08-16 Manfred Schmidt-Schauß, David Sabel
We extend a call-by-need variant of PCF with a binary probabilistic fair choice operator, which makes a lazy and typed variant of probabilistic functional programming. We define a contextual equivalence that respects the expected convergence of expressions and prove a corresponding context lemma. This enables us to show correctness of several program transformations with respect to contextual equivalence
-
Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-08-05 Misaki Kojima, Naoki Nishida
A concurrent program with semaphore-based exclusive control can be modeled by a logically constrained term rewrite system. In this paper, we first propose a framework to reduce the non-occurrence of a specified runtime error in the program to an all-path reachability problem of the transformed logically constrained term rewrite system. Here, an all-path reachability problem of the system is a pair
-
An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-07-25 Raúl López-Rueda, Santiago Escobar, Julia Sapiña
Narrowing and unification are very useful tools for symbolic analysis of rewrite theories, and thus for any model that can be specified in that way. A very clear example of their application is the field of formal cryptographic protocol analysis, which is why narrowing and unification are used in tools such as Maude-NPA, Tamarin and Akiss. In this work we present the implementation of a canonical narrowing
-
Operationally-based program equivalence proofs using LCTRSs J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-07-20 Ştefan Ciobâcă, Dorel Lucanu, Andrei Sebastian Buruiană
We propose an operationally-based framework for deductive proofs of program equivalence. It is based on encoding the language semantics as logically constrained term rewriting systems (LCTRSs) and the two programs as terms. As a novelty of our method, we show that it enables relational reasoning about programs in various settings, which are encoded in the operational semantics. For example, we show
-
Fundamentals of compositional rewriting theory J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-07-18 Nicolas Behr, Russ Harmer, Jean Krivine
A foundational theory of compositional categorical rewriting theory is presented, based on a collection of fibration-like properties that collectively induce and intrinsically structure the large collection of lemmata used in the proofs of theorems such as concurrency and associativity. The resulting highly generic proofs of these theorems are given. It is noteworthy that the proof of the concurrency
-
Composition of synchronous communicating systems J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-07-12 Franco Barbanera, Ivan Lanese, Emilio Tuosto
Communication is an essential element of modern software, yet programming and analysing communicating systems are difficult tasks. A reason for this difficulty is the lack of compositional mechanisms that preserve relevant communication properties. This problem has been recently addressed for the well-known model of communicating systems, that is sets of components consisting of finite-state machines
-
ElixirST: A session-based type system for Elixir modules J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-07-04 Adrian Francalanza, Gerard Tabone
This paper investigates the adaptation of session types to provide behavioural information about Elixir modules. We devise a type system, called ElixirST, which statically determines whether functions in an Elixir module observe their endpoint specifications, expressed as session types; a corresponding tool automating this typechecking has also been constructed. In this paper we also formally validate
-
An axiomatic approach to differentiation of polynomial circuits J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-06-30 Paul Wilson, Fabio Zanasi
Reverse derivative categories (RDCs) have recently been shown to be a suitable semantic framework for studying machine learning algorithms. Whereas emphasis has been put on training methodologies, less attention has been devoted to particular model classes: the concrete categories whose morphisms represent machine learning models. In this paper we study presentations by generators and equations of
-
Computational category-theoretic rewriting J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-06-24 Kristopher Brown, Evan Patterson, Tyler Hanks, James Fairbanks
We demonstrate how category theory provides specifications that can efficiently be implemented via imperative algorithms and apply this to the field of graph transformation. By examples, we show how this paradigm of software development makes it easy to quickly write correct and performant code. We provide a modern implementation of graph rewriting techniques at the level of abstraction of finitely-presented
-
Liquidity analysis in resource-aware programming J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-06-16 Cosimo Laneve
Liquidity is a liveness property of programs managing resources that pinpoints those programs not freezing any resource forever. We consider a simple stateful language whose resources are assets (digital currencies, non fungible tokens, etc.). Then we define a type system that tracks in a symbolic way the input-output behavior of functions with respect to assets. These types and their composition,
-
On difunctions J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-06-14 Roland Backhouse, José Nuno Oliveira
The notion of a difunction was introduced by Jacques Riguet in 1948. Since then it has played a prominent role in database theory, type theory, program specification and process theory. The theory of difunctions is, however, less known in computing than it perhaps should be. The main purpose of the current paper is to give an account of difunction theory in relation algebra, with the aim of making
-
The Maude strategy language J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-06-07 Steven Eker, Narciso Martí-Oliet, José Meseguer, Rubén Rubio, Alberto Verdejo
Rewriting logic is a natural and expressive framework for the specification of concurrent systems and logics. The Maude specification language provides an implementation of this formalism that allows executing, verifying, and analyzing the represented systems. These specifications declare their objects by means of terms and equations, and provide rewriting rules to represent potentially non-deterministic
-
Variants and satisfiability in the infinitary unification wonderland J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-06-01 José Meseguer
So far, results about variants, the finite variant property (FVP), variant unification, and variant satisfiability have been developed for equational theories E∪B where B is a set of axioms having a finitary unification algorithm, and the equations E, oriented as rewrite rules E→, are convergent modulo B. The extension to the case when B has an infinitary unification algorithm, for example because
-
A formal model for blockchain-based consent management in data sharing J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-05-26 Neda Peyrone, Duangdao Wichadakul
Consent is one of six legal bases for personal data processing mentioned in the General Data Protection Regulation (GDPR). The GDPR is a privacy law giving European Union (EU) citizens authority over personal data. It enforces software systems to collect, analyze, and share only necessary information (‘data minimization’) following the specific purpose (‘consent’). The GDPR defines consent as permission
-
Formal lumping of polynomial differential equations through approximate equivalences J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-05-12 Luca Cardelli, Giuseppe Squillace, Mirco Tribastone, Max Tschaikowski, Andrea Vandin
It is well known that exact notions of model abstraction and reduction for dynamical systems may not be robust enough in practice because they are highly sensitive to the specific choice of parameters. In this paper we consider this problem for nonlinear ordinary differential equations (ODEs) with polynomial derivatives. We introduce a model reduction technique based on approximate differential equivalence
-
Verification of mutable linear data structures and iterator-based algorithms in Dafny J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-05-05 Jorge Blázquez, Manuel Montenegro, Clara Segura
We address the verification of mutable, heap-allocated abstract data types (ADTs) in Dafny, and their traversal via iterators. For this purpose, we devise a verification methodology that makes it possible to implement ADTs based on already existing ones, while maintaining proper encapsulation. Then, we apply this methodology to the specification and implementation of linear collections such as stacks
-
A Formal Semantics for Agent Distribution and Fault Tolerance in Jason J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-04-20 Álvaro Fernández Díaz, Lars-Åke Fredlund, Clara Benac Earle, Julio Mariño
This article provides a formal specification of the distribution and fault-tolerance mechanisms of eJason. The eJason programming language is an extension to the agent-oriented programming language Jason that introduces native support for the transparent distribution of agents as well as fault-tolerance mechanisms. This formal semantics is presented from a multiagent system perspective. It unambiguously
-
Session-based concurrency in Maude: Executable semantics and type checking J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-04-06 Carlos Alberto Ramírez Restrepo, Juan C. Jaramillo, Jorge A. Pérez
Session types are a well-established approach to communication correctness in message-passing processes. Widely studied from a process calculi perspective, here we pursue an unexplored strand and investigate the use of the Maude system for implementing session-typed process languages and reasoning about session-typed process specifications. We present four technical contributions. First, we develop
-
Graph rewriting and relabeling with PBPO+: A unifying theory for quasitoposes J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-04-06 Roy Overbeek, Jörg Endrullis, Aloïs Rosset
We extend the powerful Pullback-Pushout (PBPO) approach for graph rewriting with strong matching. Our approach, called PBPO+, allows more control over the embedding of the pattern in the host graph, which is important for a large class of rewrite systems. We argue that PBPO+ can be considered a unifying theory in the general setting of quasitoposes, by demonstrating that PBPO+ can define a strict superset
-
A verified VCGen based on dynamic logic: An exercise in meta-verification with Why3 J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-03-27 Maria João Frade, Jorge Sousa Pinto
With the incresasing importance of program verification, an issue that has been receiving more attention is the certification of verification tools, addressing the vernacular question: “Who verifies the verifier?”. In this paper we approach this meta-verification problem by focusing on a fundamental component of program verifiers: the “Verification Conditions Generator” (VCGen), responsible for producing
-
Relation-changing models meet paraconsistency J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-03-15 Diana Costa, Daniel Figueiredo, Manuel A. Martins
Switch graphs are graph-like structures characterized by embedding higher-level edges (edges that link to other edges) to describe reactive phenomena. When an edge of such structure is traversed, the accessibility relation of this graph can be changed by adding/removing edges. Relation-changing models have been used to represent phenomena in diverse fields (from Biology to Computer Science) and some
-
Evaluation diversity for graph conditions J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-03-07 Sven Schneider, Leen Lambers
Graphs are used as a universal data structure in various domains. Sets of graphs (and likewise graph morphisms) can be specified using, e.g., the graph logic of Graph Conditions (GCs). The evaluation of a graph against such a GC results in a Boolean satisfaction judgement on whether the graph is specified by the GC. The graph logic is known to be as expressive as first-order logic on graphs. However
-
Formalization of the inverse kinematics of three-fingered dexterous hand J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-02-17 Guohui Wang, Shanyan Chen, Yong Guan, Zhiping Shi, Ximeng Li, Jingzhi Zhang
As an effective extension of human limbs, dexterous robotic hands based on cyber-physical systems (CPS) are used to perform diverse tasks in industrial production, medical operation, outer-space exploration, etc. The reliable functioning of dexterous robotic hands depends on the proper modeling and solving of inverse kinematics problems in the design phase. The traditional D-H parameter method for
-
Verification of the ROS NavFn Planner using Executable Specification Languages J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-02-14 Enrique Martin-Martin, Manuel Montenegro, Adrián Riesco, Juan Rodríguez-Hortalá, Rubén Rubio
The Robot Operating System (ROS) is a framework for building robust software for complex robot systems in several domains. The Navigation Stack stands out among the different libraries available in ROS, providing a set of components that can be reused to build robots with autonomous navigation capabilities. This library is a critical component, as navigation failures could have catastrophic consequences
-
A memory-related vulnerability detection approach based on vulnerability model with Petri Net J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-02-10 Jinfu Chen, Chi Zhang, Saihua Cai, Lin Zhang, Liang Ma
With the continuous development of information technology, software vulnerabilities have become a critical threat to information security. Post-release detection of memory leaks, double free and use after free is one of the most challenging research problems in software vulnerability analysis. To tackle this challenge, we introduce a vulnerability model based on Petri Net. We consider the characteristics
-
Decomposing monolithic processes in a process algebra with multi-actions J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-02-10 Maurice Laveaux, Tim A.C. Willemse
A monolithic process is a single recursive equation with data parameters, which only uses non-determinism, action prefixing, and recursion. We present a technique that decomposes such a monolithic process into multiple processes where each process defines behaviour for a subset of the parameters of the monolithic process. For this decomposition we can show that a composition of these processes is strongly
-
Program equivalence in an untyped, call-by-value functional language with uncurried functions J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-02-09 Dániel Horpácsi, Péter Bereczky, Simon Thompson
We aim to reason about the correctness of behaviour-preserving transformations of Erlang programs. Behaviour preservation is characterised by semantic equivalence. Based upon our existing formal semantics for Core Erlang, we investigate potential definitions of suitable equivalence relations. In particular we adapt a number of existing approaches of expression equivalence to a simple functional programming
-
Safety enforcement via programmable strategies in Maude J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-01-20 M. Alpuente, D. Ballis, S. Escobar, D. Galán, J. Sapiña
This work aims to provide a general mechanism for safety enforcement in rewriting logic computations. Our technique relies on an assertion-guided model transformation that leverages the newly defined Maude strategy language for ensuring rich safety policies in non-deterministic programs. The transformed system is guaranteed to comply with user-defined invariants that are expressed in a strategy-based
-
A type language for distributed reactive components governed by communication protocols J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-01-20 Zorica Savanović, Letterio Galletta
Component based software engineering (CBSE) is a methodology that aims to design and build software systems by assembling together reusable and loosely coupled components. Applying CBSE in a distributed setting is appealing but challenging: distributed applications require different remote components to interact following a well-defined protocol. In this paper we consider a model for message passing
-
Location automata for synchronised shuffle expressions J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-01-11 Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
Several notions of synchronisation in concurrent systems can be modelled by regular shuffle operators. In this paper we consider regular expressions extended with three operators corresponding respectively to strong, arbitrary, and weak synchronisation. For these expressions, we define a location based position automaton. Furthermore, we show that the partial derivative automaton is still a quotient
-
Formalizing CCS and π-calculus in Guarded Cubical Agda J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2023-01-03 Niccolò Veltri, Andrea Vezzosi
Dependent type theories with guarded recursion have shown themselves suitable for the development of denotational semantics of programming languages. In particular, Ticked Cubical Type Theory (TCTT) has been used to show that, for guarded labeled transition systems (GLTS), interpretation into the denotational semantics maps bisimilar processes to equal values. In fact the two notions are proved equivalent
-
Unification of drags and confluence of drag rewriting J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2022-12-22 Jean-Pierre Jouannaud, Fernando Orejas
Drags are a recent, natural generalization of terms which admit arbitrary cycles. A key aspect of drags is that they can be equipped with a composition operator so that rewriting amounts to replace a drag by another in a composition. In this paper, we develop a unification algorithm for drags that allows to check the local confluence property of a set of drag rewrite rules.
-
Compositional equivalences based on open pNets J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2022-11-29 Rabéa Ameur-Boulifa, Ludovic Henrio, Eric Madelaine
Establishing equivalences between programs is crucial both for verifying correctness of programs and for justifying optimisations and program transformations. There exist several equivalence relations for programs, and bisimulations are among the most versatile of these equivalences. Among bisimulations one distinguishes strong bisimulation that requires that each action of a program is simulated by
-
Event structure semantics for multiparty sessions J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2022-11-30 Ilaria Castellani, Mariangiola Dezani-Ciancaglini, Paola Giannini
We propose an interpretation of multiparty sessions as Flow Event Structures, which allows concurrency within sessions to be explicitly represented. We show that this interpretation is equivalent, when the multiparty sessions can be described by global types, to an interpretation of such global types as Prime Event Structures.
-
Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2022-11-24 Matthias Barkowsky, Holger Giese
Background Efficient querying of large graph structures is a problem at the heart of several application domains such as social networks and model driven engineering. In particular in the context of model driven engineering, where the same query is executed frequently over an evolving graph structure, incremental techniques based on RETE nets are a popular solution. However, the construction of adequate
-
Multiparty half-duplex systems and synchronous communications J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2022-11-24 Cinzia Di Giusto, Loïc Germerie Guizouarn, Etienne Lozes
FIFO automata are finite state machines communicating through FIFO queues. They can be used, for instance, to model distributed protocols. Due to the unboundedness of the FIFO queues, several verification problems are undecidable for these systems. In order to model check such systems, one may look for decidable subclasses of FIFO systems. Binary half-duplex systems are systems of two FIFO automata
-
Editorial Board J. Log. Algebr. Methods Program. (IF 0.9) Pub Date : 2022-11-15
Abstract not available