14 search results - page 3 / 3 » Proof-Producing Congruence Closure |
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
We introduce a foundational language for modelling applications over global computers whose interconnection structure can be explicitly manipulated. Together with process distribut...
CSL
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
POPL
2010
ACM
14 years 3 months ago
2010
ACM
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
RTA
2004
Springer
13 years 11 months ago
2004
Springer
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...