5550 search results - page 63 / 1110 » Different Approaches to Proof Systems |
178
Voted
ENTCS
2008
15 years 6 months ago
2008
Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This p...
185
click to vote
BIRTHDAY
2003
Springer
15 years 9 months ago
2003
Springer
Aspects are intended to add needed functionality to a system or to treat concerns of the system by augmenting or changing the existing code in a manner that cross-cuts the usual c...
174
click to vote
FSTTCS
2006
Springer
15 years 9 months ago
2006
Springer
Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of co...
172
Voted
ECAI
2004
Springer
15 years 10 months ago
2004
Springer
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieve...
176
click to vote
TPHOL
2007
IEEE
16 years 12 days ago
2007
IEEE
Formal, modular, and mechanized verification of realistic systems code is desirable but challenging. Verification of machine context management (a basis of multi-tasking) is one ...