Sciweavers

193 search results - page 9 / 39
» A Paraconsistent Higher Order Logic
Sort
View
LICS
2005
IEEE
14 years 1 months ago
Semantics of Separation-Logic Typing and Higher-Order Frame Rules
We show how to give a coherent semantics to programs that are well-specified in a version of separation logic for a language with higher types: idealized algol extended with heap...
Lars Birkedal, Noah Torp-Smith, Hongseok Yang
CADE
2001
Springer
14 years 8 months ago
Termination and Reduction Checking for Higher-Order Logic Programs
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
Brigitte Pientka
TPHOL
1998
IEEE
13 years 12 months ago
Object-Oriented Verification Based on Record Subtyping in Higher-Order Logic
We show how extensible records with structural subtyping can be represented directly in Higher-Order Logic (HOL). Exploiting some specific properties of HOL, this encoding turns o...
Wolfgang Naraschewski, Markus Wenzel
ICALP
2005
Springer
14 years 1 months ago
About Hoare Logics for Higher-Order Store
Abstract. We present a Hoare logic for a simple imperative whilelanguage with stored commands, ie. stored parameterless procedures. Stores that may contain procedures are called hi...
Bernhard Reus, Thomas Streicher
LMCS
2007
132views more  LMCS 2007»
13 years 7 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla