The TPTP problem library and associated infrastructure: from CNF to TH0, TPTP v6. 4.0
G Sutcliffe - Journal of Automated Reasoning, 2017 - Springer
This paper describes the TPTP problem library and associated infrastructure, from its use of
Clause Normal Form (CNF), via the First-Order Form (FOF) and Typed First-order Form …
Clause Normal Form (CNF), via the First-Order Form (FOF) and Typed First-order Form …
Concurrent Kleene algebra and its foundations
Abstract A Concurrent Kleene Algebra offers two composition operators, related by a weak
version of an exchange law: when applied in a trace model of program semantics, one of …
version of an exchange law: when applied in a trace model of program semantics, one of …
Internal axioms for domain semirings
J Desharnais, G Struth - Science of Computer Programming, 2011 - Elsevier
New axioms for domain operations on semirings and Kleene algebras are proposed. They
generalise the relational notion of domain–the set of all states that are related to some other …
generalise the relational notion of domain–the set of all states that are related to some other …
The TPTP problem library and associated infrastructure
G Sutcliffe - Journal of Automated Reasoning, 2017 - dl.acm.org
This paper describes the TPTP problem library and associated infrastructure, from its use of
Clause Normal Form (CNF), via the First-Order Form (FOF) and Typed First-order Form …
Clause Normal Form (CNF), via the First-Order Form (FOF) and Typed First-order Form …
Dijkstra, floyd and warshall meet kleene
P Höfner, B Möller - Formal Aspects of Computing, 2012 - Springer
Abstract Around 1960, Dijkstra, Floyd and Warshall published papers on algorithms for
solving single-source and all-sources shortest path problems, respectively. These …
solving single-source and all-sources shortest path problems, respectively. These …
Building program construction and verification tools from algebraic principles
We present a principled modular approach to the development of construction and
verification tools for imperative programs, in which the control flow and the data flow are …
verification tools for imperative programs, in which the control flow and the data flow are …
An algebra of product families
Experience from recent years has shown that it is often advantageous not to build a single
product but rather a family of similar products that share at least one common functionality …
product but rather a family of similar products that share at least one common functionality …
An efficient Coq tactic for deciding Kleene algebras
T Braibant, D Pous - International Conference on Interactive Theorem …, 2010 - Springer
We present a reflexive tactic for deciding the equational theory of Kleene algebras in the
Coq proof assistant. This tactic relies on a careful implementation of efficient finite automata …
Coq proof assistant. This tactic relies on a careful implementation of efficient finite automata …
Deciding kleene algebras in coq
T Braibant, D Pous - Logical Methods in Computer Science, 2012 - lmcs.episciences.org
We present a reflexive tactic for deciding the equational theory of Kleene algebras in the
Coq proof assistant. This tactic relies on a careful implementation of efficient finite automata …
Coq proof assistant. This tactic relies on a careful implementation of efficient finite automata …
Algebraic separation logic
HH Dang, P Höfner, B Möller - The Journal of Logic and Algebraic …, 2011 - Elsevier
We present an algebraic approach to separation logic. In particular, we give an algebraic
characterisation for assertions of separation logic, discuss different classes of assertions and …
characterisation for assertions of separation logic, discuss different classes of assertions and …