5378 search results - page 196 / 1076 » Base Logics in Argumentation |
164
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
160
click to vote
CADE
2002
Springer
16 years 7 months ago
2002
Springer
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...
199
click to vote
FOSSACS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. The resource calculus is an extension of the λ-calculus allowing to model resource consumption. Namely, the argument of a function comes as a finite multiset of resourc...
186
click to vote
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
Separation logic involves two dual forms of modularity: local reasoning makes part of the store invisible within a static scope, whereas hiding local state makes part of the store...
203
click to vote
POPL
1997
ACM
15 years 10 months ago
1997
ACM
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...