Sciweavers

292 search results - page 44 / 59
» First-order intensional logic
Sort
View
ASIAN
2006
Springer
140views Algorithms» more  ASIAN 2006»
14 years 1 months ago
On Completeness of Logical Relations for Monadic Types
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
Slawomir Lasota, David Nowak, Yu Zhang
IANDC
2007
111views more  IANDC 2007»
13 years 10 months ago
Expressiveness and complexity of graph logic
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...
Anuj Dawar, Philippa Gardner, Giorgio Ghelli
ADC
2004
Springer
109views Database» more  ADC 2004»
14 years 1 months ago
A Model of Dynamic Resource Allocation in Workflow Systems
Current collaborative work environments are characterized by dynamically changing organizational structures. Although there have been several efforts to refine work distribution, ...
Guido Governatori, Antonino Rotolo, Shazia Wasim S...
DIAGRAMS
2008
Springer
13 years 12 months ago
Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages
Abstract. The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic software specification tool. Our interest is ...
Aidan Delaney, John Taylor, Simon J. Thompson
POPL
2004
ACM
14 years 10 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