159 search results - page 24 / 32 » Specifying Proof Systems in Linear Logic with Subexponential... |
149
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
To handle today’s complexity, modern circuits and systems be specified at a high level of abstraction. Recently, SystemC has been proposed as a language that allows a fast on o...
183
click to vote
AGP
1995
IEEE
15 years 9 months ago
1995
IEEE
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
158
click to vote
LPNMR
2001
Springer
15 years 10 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
151
click to vote
LICS
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper describes an assembly-language type system capable of ensuring memory safety in the presence of both heap and stack allocation. The type system uses linear logic and a ...
173
click to vote
PEPM
2009
ACM
16 years 2 months ago
2009
ACM
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...