Sciweavers

1321 search results - page 45 / 265
» Subtyping in Logical Form
Sort
View
POPL
2002
ACM
16 years 4 days ago
Proving correctness of compiler optimizations by temporal logic
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...
AI
2002
Springer
14 years 11 months ago
Conditional independence in propositional logic
Independence--the study of what is relevant to a given problem of reasoning--is an important AI topic. In this paper, we investigate several notions of conditional independence in...
Jérôme Lang, Paolo Liberatore, Pierre...
OOPSLA
2007
Springer
15 years 6 months ago
Modular typestate checking of aliased objects
Objects often define usage protocols that clients must follow in order for these objects to work properly. Aliasing makes it notoriously difficult to check whether clients and i...
Kevin Bierhoff, Jonathan Aldrich
POPL
2010
ACM
15 years 9 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
JAPLL
2011
108views more  JAPLL 2011»
14 years 6 months ago
A deontic logic framework allowing for factual detachment
Due to the fact that a large number of our ethical and behavioural norms have a conditional form, it is of great importance that deontic logics give an account of deontic commitme...
Christian Straßer