227 search results - page 24 / 46 » A Model Theory for Paraconsistent Logic Programming |
124
click to vote
LATA
2009
Springer
15 years 9 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
212
Voted
POPL
2005
ACM
16 years 2 months ago
2005
ACM
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission be...
115
Voted
PPDP
2005
Springer
15 years 8 months ago
2005
Springer
fects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type and eff...
124
Voted
EXPERT
2006
15 years 2 months ago
2006
on abstract principles that you can't easily apply in a formal, deductive fashion. So, the favorite tools of logicians and mathematicians, such as firstorder logic, aren'...
118
Voted
ECOOP
2008
Springer
15 years 4 months ago
2008
Springer
Abstract We present a datatype package that enables the shallow embedding technique to object-oriented specification and programming languages. This datatype package incrementally ...