855 search results - page 156 / 171 » Using First-Order Logic to Reason about Policies |
GLVLSI
2009
IEEE
14 years 3 months ago
2009
IEEE
In the context of formal verification Bounded Model Checking (BMC) has shown to be very powerful for large industrial designs. BMC is used to check whether a circuit satisfies a...
TLCA
2007
Springer
14 years 2 months ago
2007
Springer
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
EDOC
2004
IEEE
14 years 16 days ago
2004
IEEE
The ODP computational viewpoint describes the functionality of a system and its environment, in terms of a configuration of objects which interact at interfaces. Computational obj...
AINA
2003
IEEE
14 years 14 days ago
2003
IEEE
Condition Data Flow Diagrams (CDFDs) are a formalized notation resulting from the integration of Yourdon Data Flow Diagrams, Petri Nets, and pre-post notation. They are used in th...
SLP
1994
13 years 10 months ago
1994
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergo...