162 search results - page 18 / 33 » Completeness Guarantees for Incomplete Reasoners |
110
click to vote
LICS
2012
IEEE
13 years 7 days ago
2012
IEEE
—This paper introduces HOpiPn, the higher-order pi-calculus with passivation and name creation, and develops an equivalence theory for this calculus. Passivation [Schmitt and Ste...
LICS
1994
IEEE
15 years 1 months ago
1994
IEEE
Relational languages such as Ruby are used to derive circuits from abstract speci cations of their behaviour. Much reasoning is done informally in Ruby using pictorial representat...
114
click to vote
POPL
2010
ACM
15 years 7 months ago
2010
ACM
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
ECOOP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
ICCD
2004
IEEE
15 years 6 months ago
2004
IEEE
Abstract— This paper proposes a technique for creating a combinational logic network with an output that signals when all other outputs have stabilized. The method is based on du...