Sciweavers

681 search results - page 98 / 137
» A Logic for True Concurrency
Sort
View
CONCUR
2001
Springer
15 years 10 months ago
Probabilistic Information Flow in a Process Algebra
We present a process algebraic approach for extending to the probabilistic setting the classical logical information flow analysis of computer systems. In particular, we employ a ...
Alessandro Aldini
VLSID
1999
IEEE
122views VLSI» more  VLSID 1999»
15 years 10 months ago
Formal Verification of an ARM Processor
This paper presents a detailed description of the application of a formal verification methodology to an ARM processor. The processor, a hybrid between the ARM7 and the StrongARM ...
Vishnu A. Patankar, Alok Jain, Randal E. Bryant
KR
1994
Springer
15 years 10 months ago
Modalities Over Actions, I. Model Theory
This paper analyzes a language for actions and the deontic modalities over actions -- i.e., the modalities permitted, forbidden and obligatory. The work is based on: (1) an action...
L. Thorne McCarty
VLDB
1990
ACM
126views Database» more  VLDB 1990»
15 years 10 months ago
Consistency of Versions in Object-Oriented Databases
This paper presents an approach to maintaining consistency of object versions in multiversion database systems. In this approach a multiversion database is considered to be a set ...
Wojciech Cellary, Geneviève Jomier
CONCUR
2000
Springer
15 years 9 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko