scispace - formally typeset
Search or ask a question

Showing papers in "The Journal of Logic and Algebraic Programming in 2021"


Journal ArticleDOI
TL;DR: It is shown that the session resulting from the composition can be typed, and its type can be computed from the global types of the starting sessions, as a consequence, lock-freedom is preserved by composition.

23 citations


Journal ArticleDOI
TL;DR: This paper uses a suite of examples to explain the basic concepts of matching logic and show how to capture many important mathematical domains, datatypes, and transition systems using patterns and specifications and proposes a human-readable formal syntax to write specifications in a modular and compact way.

13 citations


Journal ArticleDOI
TL;DR: The authors examined the impact of fake news discourse on perceptions of news media credibility and found that those who saw fake news and were not debriefed did not change their perceptions of the news media.

10 citations


Journal ArticleDOI
Scott Wright1

9 citations


Journal ArticleDOI
TL;DR: CTL* and μ-calculus are added to the repertoire of supported logics, after discussing which adaptations are needed for branching-time properties and the performance of these model checkers is compared.

9 citations


Journal ArticleDOI
TL;DR: This system allows us to uniformly capture several new behaviors in the space of asynchronous message-passing communication, including multicast, where a process sends a single message to multiple clients, replicable services, which have multiple clients and replicate themselves on-demand to handle requests from those clients.

8 citations


Journal ArticleDOI
TL;DR: A connection is established between the existing DEL framework and the theory of covering spaces in topology, and it is proved that the same result holds for any epistemic covering task: no epistemic formula explains the unsolvability.

8 citations


Journal ArticleDOI
TL;DR: Context-sensitive rewriting as mentioned in this paper is a restriction of term rewriting which is obtained by imposing replacement restrictions on the arguments of function symbols, and it has proven useful to analyze computational properties of programs written in sophisticated rewriting-based programming languages such as CafeOBJ, Haskell, Maude, OBJ *, etc.

7 citations


Journal ArticleDOI
TL;DR: In this article, a study aimed to determine the feasibility and investigate teachers' and students' responses towards professional flip pdf for thematic learning with the 'loving plants and animals' theme.

7 citations


Journal ArticleDOI
TL;DR: In this article, a qualitative approach was applied by examining the students' final projects of English writing for the academic year 2020/2021, which revealed that the most frequent interlingual form produced by the students was using Indonesian Syntax Pattern, while the intralingual form was the simplifications.

6 citations


Journal ArticleDOI
TL;DR: This work provides a formal characterisation of BPMN collaborations and some of the most significant correctness properties in the business process domain; namely, well-structuredness, safeness and soundness.

Journal ArticleDOI
TL;DR: This paper proposes a local proof system for Linear Temporal Logic and shows how such a deductive system can be used as a realistic basis for constructing online runtime monitors that provide explanations for their verdicts; and shows the resulting monitor algorithms to satisfy pleasing correctness criteria identified by other works.

Journal ArticleDOI
TL;DR: This paper illustrates the idea of using decentralized invariants attached to individual components of the structure and which only involve a bounded number of elements, and achieves fully automated proofs on three non-trivial programs.

Journal ArticleDOI
TL;DR: Using multisets, novel techniques for mechanizing the proofs of the synthesis conjectures for list–sorting algorithms are developed and demonstrated, and they are implemented in the Theorema system and generate 8 sorting algorithms and 19 auxiliary functions.

Journal ArticleDOI
TL;DR: This work presents an even simpler algorithm to compute the growth rate, based on a variant of a Perron–Frobenius theorem that has been conjectured in earlier work and integrated into CeTA, a verified certifier for various properties, including complexity proofs.

Journal ArticleDOI
TL;DR: This paper presents a visual logic that allows us to describe graph properties, including navigational properties, i.e., properties about the paths in a graph.

Journal ArticleDOI
TL;DR: The soft constraint automata framework is revised, wherein transitions are weighted and each action has an associated preference value and memory locations are equipped with an internal state to remember and update information from transition to transition.

Journal ArticleDOI
TL;DR: In this article, an incremental variant of Cylindrical algebraic decomposition (CAD) is proposed for solving satisfiability modulo theory problems for non-linear real arithmetic.

Journal ArticleDOI
TL;DR: The theoretical foundations of the method are presented, the method symbolically extracts trap invariants from interaction formulae defining the system architecture and its soundness is proved.

Journal ArticleDOI
TL;DR: The authors discuss findings arising from interviews with 24 Western Australian media consumers who offered their perspectives on Australian news coverage of asylum seekers, highlighting how participants evaluated misinformation and disinformation about asylum seekers and in particular, how some adopted a discourse of fake news to delegitimise perspectives that oppose their own stance.

Journal ArticleDOI
TL;DR: The corresponding full subcategories of the category of preordered monoids are functorially related between them as well as with the categories of pre ordered sets and monoids.

Journal ArticleDOI
TL;DR: The combination of a variable reduction strategy with a column-wise symmetry breaker leads to a scalable deployment solution, when OMT is used to solve the resulting optimization problem.

Journal ArticleDOI
TL;DR: In this paper, a dilemma discussion method was used in learning syntax from Dilemma Discussion Method (DDM) with a mean score of 4.38 (greater than the criteria).

Journal ArticleDOI
Scott Wright1
TL;DR: This paper found that attacks on journalists have increased significantly since 2016 when Trump came to power, but this is largely the preserve of populist and far-right politicians, who rarely call the media fake, instead alleging bias or questioning the veracity or standards of reporting and production.

Journal ArticleDOI
TL;DR: In this article, the authors used a descriptive qualitative approach to describe natural phenomena or human manipulation phenomena to answer two crucial problems in education, especially school refusal for Madrasah Ibtidaiyah Negeri 1 Semarang students.

Journal ArticleDOI
TL;DR: In this article, a qualitative research with a phenomenological approach, which was conducted at Muhammadiyah University of Palopo, revealed that Christian students' perception and motivation in enrolling at MU was majorly affected by the support of parents, families, self-motivation, and their major at MU.

Journal ArticleDOI
TL;DR: The halting problem is a prominent example of undecidable problem and its formulation and undecidability proof is usually attributed to Turing's 1936 landmark paper as discussed by the authors, however, it was first stated in a 1958 book by Martin Davis.

Journal ArticleDOI
TL;DR: This paper identifies a list of properties of financial derivatives written in a DSL for blockchain that exclude several security vulnerabilities and develops an infrastructure that provides means to interactively formalize and prove such properties.

Journal ArticleDOI
TL;DR: This approach envisages choreographies as a particularly suited model to derive tests in order to tame the problems of correctness of distributed applications.

Journal ArticleDOI
TL;DR: This work introduces the concept of behaviorizeable relations, which can be less rigorous than behavioral equivalence but still perform inference under implicit logical interpretations of the synthesis domain, and develops a generalized greedy framework that iteratively replaces parts of specifications with equivalent implementations.