Sciweavers

10055 search results - page 387 / 2011
» Structured programming using processes
Sort
View
NETWORKS
2008
15 years 23 days ago
Lower bounds for two-period grooming via linear programming duality
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
CADE
2009
Springer
16 years 1 months ago
Integrated Reasoning and Proof Choice Point Selection in the Jahob System - Mechanisms for Program Survival
In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, ...
Martin C. Rinard
111
Voted
SFP
2004
15 years 2 months ago
Generic proofs for combinator-based generic programs
Abstract: Generic programming can bring important benefits to software engineering. In particular, it reduces the burden of verification, since generic proofs can be instantiated a...
Fermín Reig
119
Voted
ENTCS
2008
140views more  ENTCS 2008»
15 years 26 days ago
Linking Event-B and Concurrent Object-Oriented Programs
The Event-B method is a formal approach to modelling systems, using refinement. Initial specification is a high level of abstraction; detail is added in refinement steps as the de...
Andrew Edmunds, Michael Butler
DALT
2008
Springer
15 years 2 months ago
Inductive Negotiation in Answer Set Programming
This paper provides a logical framework of negotiating agents who have capabilities of evaluating and building proposals. Given a proposal, an agent decides whether it is acceptabl...
Chiaki Sakama