Sciweavers

302 search results - page 37 / 61
» Playing with Rules
Sort
View
CALCO
2011
Springer
214views Mathematics» more  CALCO 2011»
12 years 7 months ago
Indexed Induction and Coinduction, Fibrationally
This paper extends the fibrational approach to induction and coinduction pioneered by Hermida and Jacobs, and developed by the current authors, in two key directions. First, we pr...
Clément Fumex, Neil Ghani, Patricia Johann
MICAI
2000
Springer
13 years 11 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
DIGRA
2003
Springer
14 years 1 months ago
Exploration in computer games - a new starting point
Space, vast lands and dungeons… It is no coincidence that Space War and Adventure are among the best known of the first computer games. Both clearly appeal to the player’s cur...
Simon Egenfeldt-Nielsen
ICSE
2008
IEEE-ACM
14 years 8 months ago
Data flow testing of service-oriented workflow applications
WS-BPEL applications are a kind of service-oriented application. They use XPath extensively to integrate loosely-coupled workflow steps. However, XPath may extract wrong data from...
Lijun Mei, W. K. Chan, T. H. Tse
LCC
1994
248views Algorithms» more  LCC 1994»
13 years 12 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin