Sciweavers

181 search results - page 33 / 37
» On the Completeness of Propositional Hoare Logic
Sort
View
90
Voted
CSL
1997
Springer
15 years 1 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
ESOP
2009
Springer
15 years 1 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
SPLC
2010
14 years 7 months ago
Configuring Software Product Line Feature Models Based on Stakeholders' Soft and Hard Requirements
Abstract. Feature modeling is a technique for capturing commonality and variability. Feature models symbolize a representation of the possible application configuration space, and ...
Ebrahim Bagheri, Tommaso Di Noia, Azzurra Ragone, ...
TABLEAUX
2000
Springer
15 years 1 months ago
Benchmark Analysis with FaCT
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...
Ian Horrocks
SIGECOM
2003
ACM
115views ECommerce» more  SIGECOM 2003»
15 years 2 months ago
Betting boolean-style: a framework for trading in securities based on logical formulas
We develop a framework for trading in compound securities: financial instruments that pay off contingent on the outcomes of arbitrary statements in propositional logic. Buying o...
Lance Fortnow, Joe Kilian, David M. Pennock, Micha...