Searching for "Partially Ordered Interpretations." – sorted by Relevance.
-
On the model checking problem for branching time logics and Basic Parallel Processes
- , but decidable in a standard partial order interpretation. 1 Introduction Most techniques for the verification
- Cited by 25 (1 self) – Add To MetaCart
-
Lifting abstract interpreters to quantified logical domains
- order. Using our generic construction, we build a number of abstract interpreters on top of domains
- Cited by 3 (0 self) – Add To MetaCart
-
Knowledge without Modality: A Simplified Framework for Chronological Ignorance
- in time to knowledge at that time. The partial order on interpretations gives a sense of unidirectionality
- Cited by 2 (1 self) – Add To MetaCart
-
Towards an Operational Understanding of Presheaf Models
- are interpreted by profunctors between partial orders (with closed terms denoting presheaves) was proposed
- Cited by 5 (4 self) – Add To MetaCart
-
Termination Proofs for Higher-order Rewrite Systems
- are interpreted by operations of the same arity in an algebra, equipped with a well-founded partial order
- Cited by 13 (0 self) – Add To MetaCart
-
Temporal Logics For Trace Systems: On Automated Verification
- inherent in the partial order interpretations, more specifically to distinguish concurrency from non
- Cited by 17 (6 self) – Add To MetaCart
-
Connecting many-sorted structures and theories through adjoint functions
- as a partial order on the interpretation S i of the sort S i (i = 1, 2). The combined class
- Cited by 4 (1 self) – Add To MetaCart
-
Automated Analysis of Concurrent Systems with the Constrained Expression Toolset
- 3 (see Figure 7). Under a partial order interpretation for the semantics of constrained expressions
- Cited by 71 (22 self) – Add To MetaCart
-
A New Proof of Exponential Decidability for the Propositional ยต-Calculus with Program Converse
- their names -- the least and the greatest fixed points with respect to ` as a partial order on interpretations
- Cited by 1 (0 self) – Add To MetaCart
-
Theory of Generalized Annotated Logic Programming and its Applications
- is a function into a partially ordered set I(T ), we can define a partial order on interpretations
- Cited by 139 (17 self) – Add To MetaCart

