Sciweavers

402 search results - page 38 / 81
» Model Checking Quantified Computation Tree Logic
Sort
View
CGF
1998
101views more  CGF 1998»
13 years 10 months ago
Rapid and Accurate Contact Determination between Spline Models using ShellTrees
In this paper, we present an e cient algorithm for contact determination between spline models. We make use of a new hierarchy, called ShellTree, that comprises of spherical shell...
Shankar Krishnan, M. Gopi, Ming C. Lin, Dinesh Man...
ECCB
2008
IEEE
13 years 11 months ago
Temporal logic patterns for querying dynamic models of cellular interaction networks
Abstract: Models of the dynamics of cellular interaction networks have become increasingly larger in recent years. Formal verification based on model checking provides a powerful t...
Pedro T. Monteiro, Delphine Ropers, Radu Mateescu,...
STACS
2001
Springer
14 years 3 months ago
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
Victor L. Selivanov
CASSIS
2004
Springer
14 years 4 months ago
Modelling Mobility Aspects of Security Policies
Security policies are rules that constrain the behaviour of a system. Different, largely unrelated sets of rules typically govern the physical and logical worlds. However, increa...
Pieter H. Hartel, Pascal van Eck, Sandro Etalle, R...
BIRTHDAY
2004
Springer
14 years 4 months ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer