2152 search results - page 90 / 431 » On Automating the Calculus of Relations |
JLP
2011
14 years 3 months ago
2011
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...
124
click to vote
ENTCS
2006
15 years 22 days ago
2006
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are noto...
112
click to vote
LICS
2007
IEEE
15 years 7 months ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
122
click to vote
LPAR
2004
Springer
15 years 6 months ago
2004
Springer
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
POLICY
2004
Springer
15 years 6 months ago
2004
Springer
As the interest in using policy-based approaches for systems management grows, it is becoming increasingly important to develop methods for performing analysis and refinement of p...