Sciweavers

1321 search results - page 130 / 265
» Subtyping in Logical Form
Sort
View
POPL
2004
ACM
16 years 6 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
ASPDAC
2007
ACM
124views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Improving XOR-Dominated Circuits by Exploiting Dependencies between Operands
Logic synthesis has made impressive progress in the last decade and has pervaded digital design replacing almost universally manual techniques. A remarkable exception is computer ...
Ajay K. Verma, Paolo Ienne
KR
2000
Springer
15 years 10 months ago
Significant Inferences : Preliminary Report
We explore the possibility of a logic where a conclusion substantially improves over its premise(s): Specifically, we intend to rule out inference steps such that the premise conv...
Philippe Besnard, Torsten Schaub
ATAL
2008
Springer
15 years 8 months ago
Modelling coalitions: ATL + argumentation
In the last few years, argumentation frameworks have been successfully applied to multi agent systems. Recently, argumentation has been used to provide a framework for reasoning a...
Nils Bulling, Jürgen Dix, Carlos Iván ...
CSL
2010
Springer
15 years 7 months ago
Ordered Sets in the Calculus of Data Structures
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Viktor Kuncak, Ruzica Piskac, Philippe Suter