Sciweavers

2008 search results - page 60 / 402
» Computing with Equations
Sort
View
BIRTHDAY
2005
Springer
14 years 2 months ago
Finite Equational Bases in Process Algebra: Results and Open Questions
Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...
RTA
2005
Springer
14 years 2 months ago
Intruder Deduction for AC-Like Equational Theories with Homomorphisms
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
Pascal Lafourcade, Denis Lugiez, Ralf Treinen
APLAS
2000
ACM
14 years 1 months ago
An Open Environment for Cooperative Equational Solving
We describe a system called CFLP which aims at the integration of the best features of functional logic programming (FLP), cooperative constraint solving (CCS), and distributed co...
Tetsuo Ida, Mircea Marin
ISSAC
2004
Springer
67views Mathematics» more  ISSAC 2004»
14 years 2 months ago
Rational general solutions of algebraic ordinary differential equations
We give a necessary and sufficient condition for an algebraic ODE to have a rational type general solution. For an autonomous first order ODE, we give an algorithm to compute a r...
Ruyong Feng, Xiao-Shan Gao
ASM
2003
ASM
14 years 2 months ago
Remarks on Turbo ASMs for Functional Equations and Recursion Schemes
The question raised in [15] is answered how to naturally dely used forms of recursion by abstract machines. We show that turbo ASMs as defined in [7] allow one to faithfully refl...
Egon Börger, Tommaso Bolognesi