Sciweavers

1143 search results - page 165 / 229
» Mental models of recursion
Sort
View
PARLE
1987
14 years 15 days ago
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
CAV
2008
Springer
130views Hardware» more  CAV 2008»
13 years 11 months ago
A Hybrid Type System for Lock-Freedom of Mobile Processes
We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...
Naoki Kobayashi, Davide Sangiorgi
IWFM
1998
13 years 10 months ago
Strictly Level-Decreasing Logic Programs
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...
Anthony Karel Seda, Pascal Hitzler
ATVA
2010
Springer
163views Hardware» more  ATVA 2010»
13 years 9 months ago
Automatic Generation of History-Based Access Control from Information Flow Specification
This paper proposes a method for automatically inserting check statements for access control into a given recursive program according to a given security specification. A history-b...
Yoshiaki Takata, Hiroyuki Seki
SIGMETRICS
2010
ACM
203views Hardware» more  SIGMETRICS 2010»
13 years 9 months ago
An analytical framework to infer multihop path reliability in MANETs
Abstract Due to complexity and intractability reasons, most of the analytical studies on the reliability of communication paths in mobile ad hoc networks are based on the assumptio...
Nelson Antunes, Gonçalo Jacinto, Antó...