Sciweavers

632 search results - page 66 / 127
» Combining programming with theorem proving
Sort
View
TPHOL
2005
IEEE
14 years 1 months ago
From PSL to LTL: A Formal Validation in HOL
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...
Thomas Tuerk, Klaus Schneider
ICDT
2003
ACM
91views Database» more  ICDT 2003»
14 years 1 months ago
Reformulation of XML Queries and Constraints
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
Alin Deutsch, Val Tannen
CSFW
2009
IEEE
13 years 11 months ago
Specification and Analysis of Dynamic Authorisation Policies
This paper presents a language, based on transaction logic, for specifying dynamic authorisation policies, i.e., rules governing actions that may depend on and update the authoris...
Moritz Y. Becker
AIML
2006
13 years 9 months ago
Dynamic topological logics over spaces with continuous functions
Dynamic topological logics are combinations of topological and temporal modal logics that are used for reasoning about dynamical systems consisting of a topological space and a con...
Boris Konev, Roman Kontchakov, Frank Wolter, Micha...
WOODPECKER
2001
13 years 9 months ago
Consistency Checking of RM-ODP Specifications
Ensuring that specifications are consistent is an important part of specification development and testing. In this paper we introduce the ConsVISor tool for consistency checking o...
Kenneth Baclawski, Mieczyslaw M. Kokar, Jeffrey E....