Sciweavers

200 search results - page 33 / 40
» Symbolic Equivalences for Open Systems
Sort
View
SOSP
2007
ACM
14 years 4 months ago
Tolerating byzantine faults in transaction processing systems using commit barrier scheduling
This paper describes the design, implementation, and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares ...
Ben Vandiver, Hari Balakrishnan, Barbara Liskov, S...
FOSSACS
2009
Springer
14 years 2 months ago
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
Christopher Broadbent, C.-H. Luke Ong
KBSE
2007
IEEE
14 years 1 months ago
Finding errors in components that exchange xml data
Two or more components (e.g., objects, modules, or programs) interoperate when they exchange data, such as XML data. Using Application Programming Interface (API) calls exported b...
Mark Grechanik
AO
2007
111views more  AO 2007»
13 years 7 months ago
Let's talk about our "being": A linguistic-based ontology framework for coordinating agents
Abstract. In open scenarios, agents willing to cooperate must impact the communication barrier between them and their unknown partners. If agents are not relying on any agreement a...
Maria Teresa Pazienza, Savino Sguera, Armando Stel...
IJAOSE
2010
227views more  IJAOSE 2010»
13 years 6 months ago
Implementing reactive BDI agents with user-given constraints and objectives
CASO is an agent-oriented programming language based on AgentSpeak(L), one of the most influential abstract languages based on the BDI (Beliefs-Desires-Intentions) architecture. ...
Aniruddha Dasgupta, Aditya K. Ghose