Search Results

TLA⁺ is a formal language for specifying systems, including distributed algorithms, that is supported by powerful verification tools. In this work we present a framework for checking if traces of distributed programs are compatible with high-level ...

Knowledge in mathematics (definitions, theorems, proofs, etc.) is usually expressed in a way that combines natural language and mathematical expressions (e.g. equations). Using an ontology formalism such as OWL DL is well-suited for formalizing the ...

PlusCal is a language for describing algorithms at a high level of abstraction. The PlusCal translator generates a TLA⁺ specification that can be verified using the TLA⁺ model checkers or proof assistant. We describe Distributed PlusCal, an ...

Rewriting is a widely established formalism with major applications in computer science. It is indeed a staple of many formal verification applications as it is especially well suited to describe program semantics and transformations. In particular, ...

Program transformation is a common practice in computer science, and its many applications can have a range of different objectives. For example, a program written in an original high level language could be either translated into machine code for ...

Rewriting is a formalism widely used in computer science and mathematical logic. The classical formalism has been extended, in the context of functional languages, with an order over the rules and, in the context of rewrite based languages, with the ...

This paper reports recent advances in the development of a symbolic asymptotic modeling software package, called MEMSALab, which will be used for automatic generation of asymptotic models for arrays of micro and nanosystems. More precisely, a model is a ...

First designed to enable private networks to be opened up to the outside world in a secure way, the growing complexity of organizations make firewalls indispensable to control information flow within a company. The central role they hold in the security ...

We propose a formal framework for the specification and validation of security policies. To model a secured system, the evolution of security information in the system is described by transitions triggered by authorization requests and the policy is ...

Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. This should be naturally reflected in software that provide pattern-based searches. We would like ...

We present the <Emphasis Type="SmallCaps">Tom</Emphasis> language that extends <Emphasis Type="SmallCaps">Java</Emphasis> with the purpose of providing high level constructs inspired by the rewriting community. <Emphasis Type="SmallCaps">Tom</Emphasis> ...

Data protection within information systems is one of the main concerns in computer systems security and different access control policies can be used to specify the access requests that should be granted or denied. These access control mechanisms should ...

The integration of first-order and higher-order paradigms has been one of the main challenges in the design of both declarative programming languages and proof environments. It has led to the development of new computation models and new logical ...

The graph rewriting calculus is an extension of the @r-calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using unification constraints in addition to the standard @r-calculus matching ...

The rewriting calculus has been introduced as a general formalism that uniformly integrates rewriting and @l-calculus. In this calculus all the basic ingredients of rewriting such as rewrite rules, rule applications and results are first-class objects. ...

We use the @r-calculus as an intermediate language to compile functional languages with pattern-matching features, and give an interaction net encoding of the @r-terms arising from the compilation. This encoding gives rise to new strategies of ...

Different pattern calculi integrate the functional mechanisms from the λ-calculus and the matching capabilities from rewriting. Several approaches are used to obtain the confluence but in practice the proof methods share the same structure and each ...

The Rewriting Calculus (ρ-calculus, for short) was introduced at the end of the 1990s and fully integrates term-rewriting and λ-calculus. The rewrite rules, acting as elaborated abstractions, their application and the structured results obtained are ...

Theoretical presentations of the rewriting or ý-calculus often treat the matching constraint computations as an atomic operation although matching constraints are explicitly expressed. Actual implementations have to take a more realistic view: ...

The last few years have seen the development of the rewriting calculus (also called rho-calculus or -calculus) that uniformly integrates first-order term rewriting and the -calculus. The combination of these two latter formalisms has been already ...