Sciweavers

1226 search results - page 147 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
BIRTHDAY
2008
Springer
15 years 4 months ago
What Do Semantics Matter When the Meat Is Overcooked?
Abstract. We develop an abstract operational model for configuration management under service-oriented computing. This semantics is based on a graph-based representation of the con...
José Luiz Fiadeiro
ESOP
2007
Springer
15 years 9 months ago
Computing Procedure Summaries for Interprocedural Analysis
Abstract. We describe a new technique for computing procedure summaries for performing an interprocedural analysis on programs. Procedure summaries are computed by performing a bac...
Sumit Gulwani, Ashish Tiwari
98
Voted
IANDC
2007
84views more  IANDC 2007»
15 years 3 months ago
The perfectly synchronized round-based model of distributed computing
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
136
Voted
PODS
2007
ACM
171views Database» more  PODS 2007»
16 years 3 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
POPL
1999
ACM
15 years 7 months ago
Typed Memory Management in a Calculus of Capabilities
An increasing number of systems rely on programming language technology to ensure safety and security of low-level code. Unfortunately, these systems typically rely on a complex, ...
Karl Crary, David Walker, J. Gregory Morrisett