Sciweavers

2540 search results - page 341 / 508
» Abstract Logics as Dialgebras
Sort
View
BSL
2006
93views more  BSL 2006»
15 years 1 months ago
What is Tarski's common concept of consequence?
Abstract. In 1936 Tarski sketched a rigorous definition of the concept of logical consequence which, he claimed, agreed quite well with common usage--or, as he also said, with the ...
Ignacio Jané
JAR
2008
77views more  JAR 2008»
15 years 1 months ago
Translating Higher-Order Clauses to First-Order Clauses
Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. In order to integrate interactive provers with automatic ones, it is ...
Jia Meng, Lawrence C. Paulson
JAR
2008
89views more  JAR 2008»
15 years 1 months ago
An Extensible Encoding of Object-oriented Data Models in hol
Abstract We present an extensible encoding of object-oriented data models into higherorder logic (HOL). Our encoding is supported by a datatype package that leverages the use of th...
Achim D. Brucker, Burkhart Wolff
104
Voted
LISP
2008
154views more  LISP 2008»
15 years 1 months ago
Types and trace effects for object orientation
Trace effects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type a...
Christian Skalka
TCS
2008
15 years 28 days ago
Verification of qualitative Z constraints
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
Stéphane Demri, Régis Gascon