Sciweavers

2623 search results - page 184 / 525
» Hoare Logic in the Abstract
Sort
View
86
Voted
ENTCS
2007
113views more  ENTCS 2007»
14 years 10 months ago
A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F
We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
Kevin Donnelly, Hongwei Xi
77
Voted
DLOG
2010
14 years 8 months ago
Updating TBoxes in DL-Lite
Abstract. We study the problem of updates for TBoxes represented in Description Logics of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the tractable fragments of...
Dmitriy Zheleznyakov, Diego Calvanese, Evgeny Khar...
128
Voted
LICS
2012
IEEE
13 years 19 days ago
An Automata Model for Trees with Ordered Data Values
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
Tony Tan
FUIN
2007
116views more  FUIN 2007»
14 years 10 months ago
Path Compression in Timed Automata
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...
Agata Janowska, Wojciech Penczek
CORR
2009
Springer
109views Education» more  CORR 2009»
14 years 8 months ago
Extensional and Intensional Strategies
on of abstract strategies which is extensional in the sense that a strategy is defined explicitly of derivations of an abstract reduction system. We then move to a more intensional...
Tony Bourdier, Horatiu Cirstea, Daniel J. Doughert...