Concrete Abstractions Formalizing and Analyzing Discrete Theories and Algorithms with the RISCAL Model Checker /
This book demonstrates how to formally model various mathematical domains (including algorithms operating in these domains) in a way that makes them amenable to a fully automatic analysis by computer software. The presented domains are typically investigated in discrete mathematics, logic, algebra,...
Saved in:
| Hovedforfatter: | |
|---|---|
| Institution som forfatter: | |
| Format: | Electronisk eBog |
| Sprog: | engelsk |
| Udgivet: |
Cham :
Springer International Publishing : Imprint: Springer,
2023.
|
| Udgivelse: | 1st ed. 2023. |
| Serier: | Texts & Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria,
|
| Fag: | |
| Online adgang: | https://doi.org/10.1007/978-3-031-24934-1 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|
| Summary: | This book demonstrates how to formally model various mathematical domains (including algorithms operating in these domains) in a way that makes them amenable to a fully automatic analysis by computer software. The presented domains are typically investigated in discrete mathematics, logic, algebra, and computer science; they are modeled in a formal language based on first-order logic which is sufficiently rich to express the core entities in whose correctness we are interested: mathematical theorems and algorithmic specifications. This formal language is the language of RISCAL, a “mathematical model checker” by which the validity of all formulas and the correctness of all algorithms can be automatically decided. The RISCAL software is freely available; all formal contents presented in the book are given in the form of specification files by which the reader may interact with the software while studying the corresponding book material. |
|---|---|
| Fysisk beskrivelse: | 1 online resource (XII, 271 p. 79 illus.). 53 illus. in color. |
| ISBN: | 9783031249341 |
| ISSN: | 2197-8409 |
| DOI: | 10.1007/978-3-031-24934-1 |