Sciweavers

442 search results - page 64 / 89
» Proof Abstraction for Imperative Languages
Sort
View
TPHOL
2008
IEEE
14 years 3 months ago
Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...
Daniel Wasserrab, Andreas Lochbihler
LICS
2006
IEEE
14 years 2 months ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
FCT
2005
Springer
14 years 2 months ago
Deterministic Automata on Unranked Trees
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...
Julien Cristau, Christof Löding, Wolfgang Tho...
TPHOL
2003
IEEE
14 years 1 months ago
Applications of Polytypism in Theorem Proving
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
Konrad Slind, Joe Hurd
OWLED
2007
13 years 10 months ago
Extending Fuzzy Description Logics for the Semantic Web
Fuzzy Description Logics (Fuzzy DLs) and fuzzy OWL have been proposed as languages able to represent and reason about imprecise and vague knowledge. Such extensions have gained con...
Giorgos Stoilos, Giorgos B. Stamou