Sciweavers

238 search results - page 30 / 48
» Compositional Proof Methods for Concurrency: A Semantic Appr...
Sort
View
POPL
2004
ACM
15 years 10 months ago
Symbolic transfer function-based approaches to certified compilation
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
Xavier Rival
76
Voted
DAGSTUHL
2006
14 years 11 months ago
A Framework for Analyzing Composition of Security Aspects
The methodology of aspect-oriented software engineering has been proposed to factor out concerns that are orthogonal to the core functionality of a system. In particular, this is a...
Jorge Fox, Jan Jürjens
ENTCS
2007
101views more  ENTCS 2007»
14 years 9 months ago
Semantic Determinism and Functional Logic Program Properties
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...
José Miguel Cleva, Francisco Javier L&oacut...
SIAMCOMP
2002
90views more  SIAMCOMP 2002»
14 years 9 months ago
A Virtually Synchronous Group Multicast Algorithm for WANs: Formal Approach
This paper presents a formal design for a novel group communication service targeted for WANs. The service provides Virtual Synchrony semantics. Such semantics facilitate the desi...
Idit Keidar, Roger Khazan
151
Voted
ECOOP
2009
Springer
15 years 10 months ago
Featherweight Jigsaw: A Minimal Core Calculus for Modular Composition of Classes
We present FJig, a simple calculus where basic building blocks are classes in the style of Featherweight Java, declaring elds, methods and one constructor. However, inheritance has...
Giovanni Lagorio, Marco Servetto, Elena Zucca