Sciweavers

4 search results - page 1 / 1
» Planning Equational Verification in CCS
Sort
View
KBSE
1998
IEEE
13 years 9 months ago
Planning Equational Verification in CCS
Most efforts to automate formal verification of communicating systems have centred around finite-state systems (FSSs). However, FSSs are incapable of modelling many practical comm...
Raul Monroy, Alan Bundy, Ian Green
MICAI
2000
Springer
13 years 8 months ago
Searching for a Solution to Program Verification=Equation Solving in CCS
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
Raul Monroy, Alan Bundy, Ian Green
CAV
1997
Springer
102views Hardware» more  CAV 1997»
13 years 8 months ago
Efficient Model Checking Using Tabled Resolution
We demonstrate the feasibility of using the XSB tabled logic programming system as a programmable fixed-point engine for implementing efficient local model checkers. In particular,...
Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramak...
ATAL
2007
Springer
13 years 11 months ago
Extending character-based storytelling with awareness and feelings
Most Interactive Storytelling systems developed to date have followed a task-based approach to story representation, using planning techniques to drive the story by generating a s...
David Pizzi, Marc Cavazza, Jean-Luc Lugrin