Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
ional Predicate Abstraction from Game Semantics Adam Bakewell and Dan R. Ghica University of Birmingham, U.K. We introduce a technique for using conventional predicate abstraction ...
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
In this paper we describe our experience in applying KAoS services to ensure policy compliance for Semantic Web Services workflow composition and enactment. We are developing thes...
Andrzej Uszok, Jeffrey M. Bradshaw, Renia Jeffers,...