Sciweavers

681 search results - page 99 / 137
» A Logic for True Concurrency
Sort
View
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
15 years 3 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
AKA
2004
15 years 1 months ago
On Transaction Design for UML Components
: The transaction concept enables the efficient development of concurrent and fault tolerant applications. Transaction services are therefore an essential part of modern component ...
Sten Loecher
ACST
2006
15 years 1 months ago
A combinatorial group testing method for FPGA fault location
Adaptive fault isolation methods based on discrepancyenabled pairwise comparisons are developed for reconfigurable logic devices. By observing the discrepancy characteristics of m...
Carthik A. Sharma, Ronald F. DeMara
ROOM
2000
15 years 1 months ago
An Overview of The Mensurae Language: Specifying Business Processes
We describe a language which can be used to model business processes (both technical and nontechnical). It has a formal semantics, so as to enable formal analysis and prediction o...
T. S. E. Maibaum
ENTCS
2010
130views more  ENTCS 2010»
14 years 12 months ago
Compositional System Security with Interface-Confined Adversaries
This paper presents a formal framework for compositional reasoning about secure systems. A key insight is to view a trusted system in terms of the interfaces that the various comp...
Deepak Garg, Jason Franklin, Dilsun Kirli Kaynar, ...