Sciweavers

336 search results - page 3 / 68
» Implementing CCS in Maude
Sort
View
ENTCS
2008
96views more  ENTCS 2008»
13 years 7 months ago
Maude as a Platform for Designing and Implementing Deep Inference Systems
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
Ozan Kahramanogullari
FMOODS
2007
13 years 9 months ago
Distributed Applications Implemented in Maude with Parameterized Skeletons
Abstract. Algorithmic skeletons are a well-known approach for implementing parallel and distributed applications. Declarative versions typically use higher-order functions in funct...
Adrián Riesco, Alberto Verdejo
KBSE
1998
IEEE
13 years 12 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 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