Sciweavers

169 search results - page 13 / 34
» Characterizing and checking self-healability
Sort
View
ENTCS
2007
158views more  ENTCS 2007»
13 years 7 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer
DAC
2004
ACM
14 years 8 months ago
A general decomposition strategy for verifying register renaming
This paper describes a strategy for verifying data-hazard correctness of out-of-order processors that implement register-renaming. We define a set of predicates to characterize re...
Hazem I. Shehata, Mark Aagaard
LPAR
2007
Springer
14 years 1 months ago
Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...
Roberto Maieli
COCOON
2003
Springer
14 years 26 days ago
Petri Nets with Simple Circuits
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
Hsu-Chun Yen, Lien-Po Yu
KYOTODL
2000
51views more  KYOTODL 2000»
13 years 9 months ago
Self-Maintained Folder Hierarchies as Document Repositories
This paper presents a novel approach for the management of large collections of electronic documents. The major technical contribution of our approach is the seamless integration ...
Johann Eder, Alexander Krumpholz, Alexandros Bilir...