159 search results - page 6 / 32 » Specifying Proof Systems in Linear Logic with Subexponential... |
110
click to vote
CONCUR
2004
Springer
15 years 6 months ago
2004
Springer
We present a modular approach to defining logics for a wide variety of state-based systems. We use coalgebras to model the behaviour of systems, and modal logics to specify behavi...
GCC
2003
Springer
15 years 6 months ago
2003
Springer
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
111
click to vote
FM
2003
Springer
15 years 6 months ago
2003
Springer
As the systems we have to specify and verify become larger and more complex, there is a mounting need to combine different tools and decision procedures to accomplish large proof ...
152
click to vote
CSFW
2010
IEEE
15 years 5 months ago
2010
IEEE
—Authorization logics allow concise specification of flexible access-control policies, and are the basis for logic-based access-control systems. In such systems, resource owner...
215
click to vote
POPL
2008
ACM
16 years 1 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...