Sciweavers

310 search results - page 10 / 62
» Sound and complete models of contracts
Sort
View
ASM
2003
ASM
14 years 28 days ago
A Framework for Proving Contract-Equipped Classes
r in: Abstract State Machines 2003 — Advances in Theory and Applications, Proc. 10th International Workshop, Taormina, Italy, March 3-7, 2003, eds. Egon Boerger, Angelo Gargantin...
Bertrand Meyer
PLDI
2003
ACM
14 years 28 days ago
A provably sound TAL for back-end optimization
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
Juan Chen, Dinghao Wu, Andrew W. Appel, Hai Fang
MAGS
2008
104views more  MAGS 2008»
13 years 7 months ago
Retractable contract network for empowerment in workforce scheduling
This paper is about business modelling and negotiation protocol design in distributed scheduling, where individual agents have individual (potentially conflicting) interests. It i...
Edward P. K. Tsang, Timothy Gosling, Botond Virgin...
ATAL
2007
Springer
14 years 1 months ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker
ECOOP
2009
Springer
14 years 8 months ago
Checking Framework Interactions with Relationships
Software frameworks impose constraints on how plugins may interact with them. Many of hese constraints involve multiple objects, are temporal, and depend on runtime values. Additi...
Ciera Jaspan, Jonathan Aldrich