HOL-TestGen/CirTA is a theorem-prover based test generation environment for specifications written in Circus, a process-algebraic specification language in the tradition of CSP. HOL-TestGen/CirTA is based on a formal embedding of its semantics in Isabelle/HOL, allowing to derive rules over specification constructs in a logically safe way. Beyond the derivation of algebraic laws and calculi for ...

The program of Langlands is studied here on the basis of: • new concepts of global class field theory related to the explicit construction of global class fields and of reciprocity laws; • the representations of the reductive algebraic groups GL(n) constituting the n-dimensional representations of the associated global Weil-Deligne groups; • a toroidal compactification of the conjugacy classes ...

The program of Langlands is studied here on the basis of: • new concepts of global class field theory related to the explicit construction of global class fields and of reciprocity laws; • the representations of the reductive algebraic groups GL(n) constituting the n-dimensional representations of the associated global Weil-Deligne groups; • a toroidal compactification of the conjugacy classes ...

‎from hilbert's theorem of zeroes‎, ‎and from noether's ideal theory‎, ‎birkhoff derived certain algebraic concepts (as explained by tholen) that have a dual significance in general toposes‎, ‎similar to their role in the original examples of algebraic geometry‎. ‎i will describe a simple example that illustrates some of the aspects of this relationship‎. the dualization from algebra to geometr...

We prove that any invariant algebraic set of a given polynomial vector field can be algebraically represented by one polynomial and a finite set of its successive Lie derivatives. This so-called differential radical characterization relies on a sound abstraction of the reachable set of solutions by the smallest variety that contains it. The characterization leads to a differential radical invar...

We prove that any invariant algebraic set of a given polynomial vector field can be algebraically represented by one polynomial and a finite set of its successive Lie derivatives. This so-called differential radical characterization relies on a sound abstraction of the reachable set of solutions by the smallest variety that contains it. The characterization leads to a differential radical invar...

Process algebraic specifications can provide useful support for the architectural design of software systems due to the possibility of analyzing their properties. In addition to that, such specifications can be exploited to guide the generation of code. What is needed at this level is a general methodology that accompanies the translation process, which in particular should help understanding w...

This paper addresses computational efficiency issues of a new algebraic method for imagery registration/conflation. An algebraic approach to conflation/registration of images does not depend on identifying common points. It uses the method of algebraic invariants to provide a common set of coordinates to images using chains of line segments formally described as polylines with possible gaps bet...

Systems for declarative large-scale machine learning (ML) algorithms aim at high-level algorithm specification and automatic optimization of runtime execution plans. State-ofthe-art compilers rely on algebraic rewrites and operator selection, including fused operators to avoid materialized intermediates, reduce memory bandwidth requirements, and exploit sparsity across chains of operations. How...

In recent years, a number of Dutch companies have used the algebraic specification formalism ASF+SDF. Bank MeesPierson has specified a language for describing interest rate products, their translation into COBOL, and their generation from interactive questionnaires. A consultancy company has specified a language to represent the company’s object-oriented models, and the compilation of this lang...