en.unionpedia.org

Alt-Ergo, the Glossary

Index Alt-Ergo

Alt-Ergo, an automatic solver for mathematical formulas, is mainly used in formal program verification.[1]

Table of Contents

  1. 23 relations: B-Method, Data type, Decision problem, Depth-first search, E-graph, Enumerated type, Floating-point arithmetic, Formal verification, Formula, Frama-C, Free and open-source software, French National Centre for Scientific Research, Mathematics, OCaml, Paris-Sud University, Polymorphism (computer science), Record (computer science), Rodin tool, SAT solver, Satisfiability modulo theories, SPARK (programming language), Uninterpreted function, Z3 Theorem Prover.

  2. Formal methods tools
  3. OCaml software

B-Method

The B method is a method of software development based on B, a tool-supported formal method based on an abstract machine notation, used in the development of computer software. Alt-Ergo and b-Method are formal methods tools.

See Alt-Ergo and B-Method

Data type

In computer science and computer programming, a data type (or simply type) is a collection or grouping of data values, usually specified by a set of possible values, a set of allowed operations on these values, and/or a representation of these values as machine types.

See Alt-Ergo and Data type

Decision problem

In computability theory and computational complexity theory, a decision problem is a computational problem that can be posed as a yes–no question of the input values.

See Alt-Ergo and Decision problem

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures.

See Alt-Ergo and Depth-first search

E-graph

In computer science, an e-graph is a data structure that stores an equivalence relation over terms of some language.

See Alt-Ergo and E-graph

Enumerated type

In computer programming, an enumerated type (also called enumeration, enum, or factor in the R programming language, and a categorical variable in statistics) is a data type consisting of a set of named values called elements, members, enumeral, or enumerators of the type.

See Alt-Ergo and Enumerated type

Floating-point arithmetic

In computing, floating-point arithmetic (FP) is arithmetic that represents subsets of real numbers using an integer with a fixed precision, called the significand, scaled by an integer exponent of a fixed base.

See Alt-Ergo and Floating-point arithmetic

Formal verification

In the context of hardware and software systems, formal verification is the act of proving or disproving the correctness of a system with respect to a certain formal specification or property, using formal methods of mathematics.

See Alt-Ergo and Formal verification

Formula

In science, a formula is a concise way of expressing information symbolically, as in a mathematical formula or a chemical formula.

See Alt-Ergo and Formula

Frama-C

Frama-C stands for Framework for Modular Analysis of C programs. Alt-Ergo and Frama-C are formal methods tools, Linux software, OCaml software and software testing tools.

See Alt-Ergo and Frama-C

Free and open-source software

Free and open-source software (FOSS) is software that is available under a license that grants the right to use, modify, and distribute the software, modified or not, to everyone free of charge.

See Alt-Ergo and Free and open-source software

French National Centre for Scientific Research

The French National Centre for Scientific Research (Centre national de la recherche scientifique, CNRS) is the French state research organisation and is the largest fundamental science agency in Europe.

See Alt-Ergo and French National Centre for Scientific Research

Mathematics

Mathematics is a field of study that discovers and organizes abstract objects, methods, theories and theorems that are developed and proved for the needs of empirical sciences and mathematics itself.

See Alt-Ergo and Mathematics

OCaml

OCaml (formerly Objective Caml) is a general-purpose, high-level, multi-paradigm programming language which extends the Caml dialect of ML with object-oriented features. Alt-Ergo and OCaml are OCaml software.

See Alt-Ergo and OCaml

Paris-Sud University

Paris-Sud University (French: Université Paris-Sud), also known as the University of Paris — XI (or as the Université d'Orsay before 1971), was a French research university distributed among several campuses in the southern suburbs of Paris, including Orsay, Cachan, Châtenay-Malabry, Sceaux, and Kremlin-Bicêtre campuses.

See Alt-Ergo and Paris-Sud University

Polymorphism (computer science)

In programming language theory and type theory, polymorphism is the use of a single symbol to represent multiple different types.

See Alt-Ergo and Polymorphism (computer science)

Record (computer science)

In computer science, a record (also called a structure, struct, or compound data type) is a composite data structure a collection of fields, possibly of different data types, typically fixed in number and sequence.

See Alt-Ergo and Record (computer science)

The Rodin tool is a software tool for formal modelling in Event-B. It was developed as part of several collaborative European Union projects, including initially the RODIN project (2004–2007). Alt-Ergo and Rodin tool are formal methods tools.

See Alt-Ergo and Rodin tool

SAT solver

In computer science and formal methods, a SAT solver is a computer program which aims to solve the Boolean satisfiability problem.

See Alt-Ergo and SAT solver

Satisfiability modulo theories

In computer science and mathematical logic, satisfiability modulo theories (SMT) is the problem of determining whether a mathematical formula is satisfiable.

See Alt-Ergo and Satisfiability modulo theories

SPARK (programming language)

SPARK is a formally defined computer programming language based on the Ada programming language, intended for the development of high integrity software used in systems where predictable and highly reliable operation is essential.

See Alt-Ergo and SPARK (programming language)

Uninterpreted function

In mathematical logic, an uninterpreted function or function symbol is one that has no other property than its name and n-ary form.

See Alt-Ergo and Uninterpreted function

Z3 Theorem Prover

Z3, also known as the Z3 Theorem Prover, is a satisfiability modulo theories (SMT) solver developed by Microsoft.

See Alt-Ergo and Z3 Theorem Prover

See also

Formal methods tools

OCaml software

References

[1] https://en.wikipedia.org/wiki/Alt-Ergo