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

TL;DR: A structural approach to operational semantics as discussed by the authors was proposed by Plotkin et al. in the early 1970s, involving many people and building on previous work on programming languages and logic, including abstract syntax, the SECD machine, and abstract interpreting machines.

TL;DR: The paper explains the crucial differences between SOS and MSOS, and illustrates how MSOS descriptions are written, and discusses standard notions of semantic equivalence based on MSOS.

TL;DR: The basic structure of an environment for proving Java programs annotated with JML specifications is described, which is generic with respect to the API, and thus well suited for JavaCard applets certification.

TL;DR: This paper contributes a proof theoretic characterisation of the well-founded semantics for logic programs by reviewing several methods to associate transition relations to transition system specifications with negative premises in Plotkin's structural operational style.

TL;DR: The implementation of two of these approaches for Java within the LOOP project is described, which involves the WP-infrastructures in the higher order logic of the theorem prover PVS, together with associated rules and strategies for automatically proving JML specifications for Java implementations.

TL;DR: In this article, the authors describe how a grammar (in SDF ) can be used to generate a library of access functions that manipulate the parse trees of terms over this syntax, which results in the elimination of 47% of the handwritten code, thus greatly improving both maintainability and their flexibility with respect to changes in the parse tree format.

TL;DR: In this paper, the authors discuss a combination of GSOS-type structural operational semantics with explicit termination, that they call the tagh-format (tagh being short for termination and GSOS hybrid) and prove the soundness of the synthesized laws and show their completeness modulo bisimulation.

TL;DR: The operational semantics of Carmel, a language that models the Java Card Virtual Machine Language, are presented, which defines a small-step relation between program configurations, including rules for exception handling, array objects and subroutines.

TL;DR: This paper aims at fitting a general class of recursive equations into the framework of `well-behaved' structural operational semantics, formalized as bialgebraic semantics by Turi and Plotkin, and finds that regular unfolding rules can be merged seamlessly with abstract operational rules.

TL;DR: It is argued that, by supporting a mixture of “compositional” and “structural” styles of proof, sequent-based proof systems provide a useful framework for the formal verification of processes.

TL;DR: It is proved that a slight variant of Focardi and Gorrieri's Security Process Algebra, the Kleene star recursion construct, the replication construct of polyadic π-calculus, and a process algebra extending BPAϵτ to deal with two level systems, respect both formats.

TL;DR: A uniform framework, based on the Ordered Structural Operational Semantics (OSOS) approach of Ulidowski and Phillips, for process languages with discrete relative time is proposed, which allows the user to select favourite process operators, whether they are standard operators or new application-specific operators, provided that they are OSOS definable and their OSOS rules satisfy several simple conditions.

TL;DR: An elementary Java Card electronic purse applet is presented whose specification can be simply formulated as “in normal operation, the applet’s balance field can only be decreased, never increased”.

TL;DR: The basis for this work is an extensive formalization of the Java bytecode type system, which is first presented in an abstract, lattice-theoretic setting and then instantiated to Java types.

TL;DR: This work provides a pragmatic, transformation-based approach for expressing and tracking changes in rule-based programs in the course of program evolution, and designs an operator suite for the transformation of rule- based programs.

TL;DR: The advantages and limitations of ATerms as a manipulation and exchange format in the setting of FERUS are discussed and a new, graph-like format is presented, which offers complementary features to a term-based format.

TL;DR: This paper explains how GC², a new mark-and-sweep generational garbage collector for the ATerm library that builds upon some peculiarities of this functional library is designed and implemented.

TL;DR: In this paper, network algebra descriptions are translated uniformly to Java yielding a component-based simulation model, which is used to reflect the characteristics of real-world systems and is used in our work.