Sciweavers

3931 search results - page 50 / 787
» Separation logic and abstraction
Sort
View
LICS
2010
IEEE
14 years 8 months ago
On Strong Maximality of Paraconsistent Finite-Valued Logics
Abstract—Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain as much as possible fro...
Arnon Avron, Ofer Arieli, Anna Zamansky
FOSSACS
2005
Springer
15 years 3 months ago
Expressivity of Coalgebraic Modal Logic: The Limits and Beyond
Modal logic has a good claim to being the logic of choice for describing the reactive behaviour of systems modeled as coalgebras. Logics with modal operators obtained from so-calle...
Lutz Schröder
AIML
2006
14 years 11 months ago
ML is not finitely axiomatizable over Cheq
abstract. We show that the Medvedev logic ML is not finitely axiomatizable over the logic Cheq of chequered subsets of R. This gives a negative solution to one of the questions rai...
Gaëlle Fontaine
WWW
2004
ACM
15 years 10 months ago
Enforcing strict model-view separation in template engines
The mantra of every experienced web application developer is the same: thou shalt separate business logic from display. Ironically, almost all template engines allow violation of ...
Terence John Parr
CONCUR
2008
Springer
14 years 11 months ago
A Model of Dynamic Separation for Transactional Memory
Abstract. Dynamic separation is a new programming discipline for systems with transactional memory. We study it formally in the setting of a small calculus with transactions. We pr...
Martín Abadi, Tim Harris, Katherine F. Moor...