Sciweavers

2272 search results - page 267 / 455
» A Calculus for
Sort
View
ENTCS
2008
170views more  ENTCS 2008»
15 years 4 months ago
A Coq Library for Verification of Concurrent Programs
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
Reynald Affeldt, Naoki Kobayashi
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 4 months ago
Calculating modules in contextual logic program refinement
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
Robert Colvin, Ian J. Hayes, Paul A. Strooper
ENTCS
2006
173views more  ENTCS 2006»
15 years 4 months ago
Formal Security Analysis for Ad-Hoc Networks
In ad-hoc networks, autonomous wireless nodes can communicate by forwarding messages for each other. For routing protocols in this setting, it is known that a malicious node can p...
Sebastian Nanz, Chris Hankin
IJVR
2008
137views more  IJVR 2008»
15 years 4 months ago
Reasoning about Action for Behavioral Animation of Intelligent Virtual Agents
Recent work in behavioral animation has taken impressive steps towards a virtual human. As for intelligent virtual agents, abbreviated "IVAs", the behaviors displayed in ...
Yisong Liu, Shan Zhong, Yongzhao Zhan
IPL
2008
102views more  IPL 2008»
15 years 4 months ago
The connection between two ways of reasoning about partial functions
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
John S. Fitzgerald, Cliff B. Jones