Sciweavers

77 search results - page 5 / 16
» Building BSP Programs Using the Refinement Calculus
Sort
View
ICPADS
1996
IEEE
13 years 11 months ago
Transactional programming for distributed agent systems
A new multiagent programmingparadigm based on the transactional logic model' is developed. This paradigm enables us to construct a Distributed agent transactional program (DA...
V. K. Murthy
TOSEM
2002
69views more  TOSEM 2002»
13 years 6 months ago
Mixin layers: an object-oriented implementation technique for refinements and collaboration-based designs
A "refinement" is a functionality addition to a software project that can affect multiple dispersed implementation entities (functions, classes, etc.). In this paper, we...
Yannis Smaragdakis, Don S. Batory
HICSS
1998
IEEE
128views Biometrics» more  HICSS 1998»
13 years 11 months ago
A Situation Calculus Model of Hypertext
We utilize the situation calculus to develop a logical model of hypertext systems. The work builds upon the earlier work of Bieber and Kimbrough in the logical modeling of hyperte...
Richard B. Scherl, Michael Bieber, Fabio Vitali
ENTCS
2006
97views more  ENTCS 2006»
13 years 7 months ago
VyrdMC: Driving Runtime Refinement Checking with Model Checkers
This paper presents VyrdMC, a runtime verification tool we are building for concurrent software components. The correctness criterion checked by VyrdMC is refinement: Each executi...
Tayfun Elmas, Serdar Tasiran
LICS
1994
IEEE
13 years 11 months ago
A Multiple-Conclusion Meta-Logic
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
Dale Miller