# Difference between revisions of "Projects"

Line 26: | Line 26: | ||

Circ is an automated prover that is implemented as an extension of Maude. Circ implements the ''circularity principle'', which generalizes both circular coinduction and structural induction, and can be expressed in plain English | Circ is an automated prover that is implemented as an extension of Maude. Circ implements the ''circularity principle'', which generalizes both circular coinduction and structural induction, and can be expressed in plain English | ||

as follows. Assume that each equation of interest (to be proved) ''e'' admits a frozen form ''fr(e)'' and a set of derived equations [[ Circ | [more ...]]] {{TryItOnline|Special:CircOnline}} | as follows. Assume that each equation of interest (to be proved) ''e'' admits a frozen form ''fr(e)'' and a set of derived equations [[ Circ | [more ...]]] {{TryItOnline|Special:CircOnline}} | ||

+ | |||

== Past Projects == | == Past Projects == | ||

+ | |||

{{Header | [[Generic First-Order Logic | GFOL]]}} | {{Header | [[Generic First-Order Logic | GFOL]]}} | ||

[[Generic First-Order Logic | GFOL]] is a logic whose formulae are built using the traditional first-order connectives and quantifiers, but whose terms are ''generic'', in the sense that no particular syntax is assumed for them. Terms are only required to constitute a ''term syntax'', i.e., to have free variables and substitution that obey some natural axioms. Classical first-order terms, as well as any type of terms involving bindings, fall into this category. Many lambda calculi can be ''viewed as'' (and not merely ''encoded as'') theories in [[Generic First-Order Logic | GFOL]]. This has an important methodological consequence for our calculi- and programming-languages- specification goals: the "general purpose" [[Generic First-Order Logic | GFOL]] semantics offers, in a uniform way, meaningful semantics for each particular specified calculus [[ Generic First-Order Logic | [more ...]]] | [[Generic First-Order Logic | GFOL]] is a logic whose formulae are built using the traditional first-order connectives and quantifiers, but whose terms are ''generic'', in the sense that no particular syntax is assumed for them. Terms are only required to constitute a ''term syntax'', i.e., to have free variables and substitution that obey some natural axioms. Classical first-order terms, as well as any type of terms involving bindings, fall into this category. Many lambda calculi can be ''viewed as'' (and not merely ''encoded as'') theories in [[Generic First-Order Logic | GFOL]]. This has an important methodological consequence for our calculi- and programming-languages- specification goals: the "general purpose" [[Generic First-Order Logic | GFOL]] semantics offers, in a uniform way, meaningful semantics for each particular specified calculus [[ Generic First-Order Logic | [more ...]]] |

## Revision as of 21:14, 10 March 2013

K |
---|

* K* is a rewrite-based executable semantic framework in which programming languages, type systems and formal analysis tools can be defined using configurations, computations and rules. Configurations organize the state in units called cells, which are labeled and can be nested. Computations carry computational meaning as special nested list structures sequentializing computational tasks, such as fragments of program [more ...]

Matching Logic |
---|

* Matching logic* allows us to regard a language through both operational and axiomatic lenses at the same time, making no distinction between the two. A programming language is given a semantics as a set of rewrite rules. A language-independent proof system can then be used to derive both operational behaviours and formal properties of a program. In other words, one matching logic semantics fulfils the roles of both operational and axiomatic semantics in a uniform manner [more ...]

MOP |
---|

* Monitoring-Oriented Programming*, abbreviated MOP, is a software development and analysis framework aiming at reducing the gap between formal specification and implementation by allowing them

*together*to form a system. In MOP, runtime monitoring is supported and encouraged as a fundamental principle for building reliable software. [more ...]

jPredictor |
---|

Concurrent runtime verification aims at detecting concurrency errors in a system by running it and observing its execution traces; errors can be detected despite the fact that the analyzed execution traces may not necessarily hit them. Typical concurrency errors include dataraces and deadlocks, both notoriously hard to detect by ordinary testing, but general safety property violations (expressed using MOP logics) can also be detected. Static analisis can be used to improve the predictive capability of concurrent runtime verification. [more ...]

- jPredictor is a concurrent runtime verification tool for Java

Circ |
---|

Circ is an automated prover that is implemented as an extension of Maude. Circ implements the *circularity principle*, which generalizes both circular coinduction and structural induction, and can be expressed in plain English
as follows. Assume that each equation of interest (to be proved) *e* admits a frozen form *fr(e)* and a set of derived equations [more ...]

## Past Projects

GFOL |
---|

GFOL is a logic whose formulae are built using the traditional first-order connectives and quantifiers, but whose terms are *generic*, in the sense that no particular syntax is assumed for them. Terms are only required to constitute a *term syntax*, i.e., to have free variables and substitution that obey some natural axioms. Classical first-order terms, as well as any type of terms involving bindings, fall into this category. Many lambda calculi can be *viewed as* (and not merely *encoded as*) theories in GFOL. This has an important methodological consequence for our calculi- and programming-languages- specification goals: the "general purpose" GFOL semantics offers, in a uniform way, meaningful semantics for each particular specified calculus [more ...]