Sciweavers

64 search results - page 1 / 13
» Equational Axioms of Test Algebra
Sort
View
CSL
1997
Springer
13 years 9 months ago
Equational Axioms of Test Algebra
We present a complete axiomatization of test algebra ( 24, 18, 29]), the two-sorted algebraic variant of Propositional Dynamic Logic (PDL, 21, 7]). The axiomatization consists of ...
Marco Hollenberg
JAR
2010
98views more  JAR 2010»
12 years 11 months ago
Proof-Guided Test Selection from First-Order Specifications with Equality
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ide...
Delphine Longuet, Marc Aiguier, Pascale Le Gall
LFP
1990
171views more  LFP 1990»
13 years 6 months ago
Operational and Axiomatic Semantics of PCF
PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms ...
Brian T. Howard, John C. Mitchell
LICS
2000
IEEE
13 years 9 months ago
Complete Axioms for Categorical Fixed-Point Operators
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operator is defined, embodying the equational properties of iteration theories. We p...
Alex K. Simpson, Gordon D. Plotkin
CALCO
2009
Springer
161views Mathematics» more  CALCO 2009»
13 years 11 months ago
Free Heyting Algebras: Revisited
Abstract. We use coalgebraic methods to describe finitely generated free Heyting algebras. Heyting algebras are axiomatized by rank 0-1 axioms. In the process of constructing free...
Nick Bezhanishvili, Mai Gehrke