Sciweavers

860 search results - page 54 / 172
» A Process Algebra Based Verification of a Production System
Sort
View
IJAOSE
2008
97views more  IJAOSE 2008»
13 years 9 months ago
Formal driven prototyping approach for multiagent systems
: Even if Multiagent Systems (MASs) are recognised as an appealing paradigm for designing many computer systems ranging from complex distributed systems to intelligent software app...
Vincent Hilaire, Pablo Gruer, Abderrafiaa Koukam, ...
FSTTCS
2010
Springer
13 years 7 months ago
First-Order Logic with Reachability Predicates on Infinite Systems
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
Stefan Schulz
TOPLAS
2008
138views more  TOPLAS 2008»
13 years 9 months ago
Decomposing bytecode verification by abstract interpretation
act Interpretation C. BERNARDESCHI, N. DE FRANCESCO, G. LETTIERI, L. MARTINI, and P. MASCI Universit`a di Pisa Bytecode verification is a key point in the security chain of the Jav...
Cinzia Bernardeschi, Nicoletta De Francesco, Giuse...
CONCUR
1993
Springer
14 years 1 months ago
A Practical Technique for Process Abstraction
cal Technique for Process Abstraction Glenn Bruns Department of Computer Science University of Edinburgh Edinburgh EH9 3JZ, UK Abstract. With algebraic laws a process can be simpli...
Glenn Bruns
IWIA
2005
IEEE
14 years 2 months ago
Attack-Potential-Based Survivability Modeling for High-Consequence Systems
Previous quantitative models of security or survivability have been defined on a range of probable intruder behavior. This measures survivability as a statistic such as mean time...
John McDermott