Sciweavers

852 search results - page 108 / 171
» entcs 2010
Sort
View
110
Voted
ENTCS
2007
100views more  ENTCS 2007»
15 years 13 days ago
Lightweight Static Capabilities
We describe a modular programming style that harnesses modern type systems to verify safety conditions in practical systems. This style has three ingredients: (i) A compact kernel...
Oleg Kiselyov, Chung-chieh Shan
ENTCS
2007
102views more  ENTCS 2007»
15 years 13 days ago
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
Brigitte Pientka
100
Voted
ENTCS
2007
121views more  ENTCS 2007»
15 years 13 days ago
Rewrite-Based Decision Procedures
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
Maria Paola Bonacina, Mnacho Echenim
74
Voted
ENTCS
2007
100views more  ENTCS 2007»
15 years 13 days ago
Extensionality of Spatial Observations in Distributed Systems
We discuss the tensions between intensionality and extensionality of spatial observations in distributed systems, showing that there are natural models where extensional observati...
Luís Caires, Hugo Torres Vieira
ENTCS
2007
108views more  ENTCS 2007»
15 years 13 days ago
Termination Criteria for DPO Transformations with Injective Matches
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...
Tihamer Levendovszky, Ulrike Prange, Hartmut Ehrig