210 search results - page 7 / 42 » Definability and automorphisms in abstract logics |
176
Voted
CP
2009
Springer
16 years 9 days ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
CAV
2010
Springer
14 years 12 months ago
2010
Springer
We define and study a new abstract domain which is a fine-grained combination of zonotopes with (sub-)polyhedric domains such as the interval, ocinear template or polyhedron domain...
133
Voted
AMAST
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
WADT
1998
Springer
15 years 3 months ago
1998
Springer
Abstract. The conditions under which a formal system for reasoning about structural specifications, built over one logical system could be reused for reasoning about structured spe...
CADE
2010
Springer
15 years 23 days ago
2010
Springer
Abstract. We introduce a semantics for classical logic with partial functions. We believe that the semantics is natural. When a formula contains a subterm in which a function is ap...