Sciweavers

49 search results - page 7 / 10
» Operational and Axiomatic Semantics of PCF
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Reasoning about agent execution strategies
We present a logic for reasoning about properties of agent programs under different agent execution strategies. Using the agent programming language SimpleAPL as an example, we sh...
Natasha Alechina, Brian Logan, Mehdi Dastani, John...
JUCS
2006
89views more  JUCS 2006»
13 years 7 months ago
Process Equivalences as Global Bisimulations
: Bisimulation can be defined in a simple way using coinductive methods, and has rather pleasant properties. Ready similarity was proposed by Meyer et al. as a way to weakening the...
David de Frutos-Escrig, Carlos Gregorio-Rodr&iacut...
ENTCS
2006
98views more  ENTCS 2006»
13 years 7 months ago
A Generic Process Algebra
The three classical process algebras CCS, CSP and ACP present several differences in their respective technical machinery. This is due, not only to the difference in their operato...
Jos C. M. Baeten, Mario Bravetti
JOT
2008
142views more  JOT 2008»
13 years 7 months ago
cmUML - A UML based Framework for Formal Specification of Concurrent, Reactive Systems
Complex software systems possess concurrent and reactive behaviors requiring precise specifications prior to development. Lamport's transition axiom method is a formal specif...
Jagadish Suryadevara, Lawrence Chung, R. K. Shyama...
TASE
2008
IEEE
14 years 1 months ago
Verifying BPEL-Like Programs with Hoare Logic
The WS-BPEL language has recently become a de facto standard for modeling Web-based business processes. One of its essential features is the fully programmable compensation mechan...
Chenguang Luo, Shengchao Qin, Zongyan Qiu