Sciweavers

3729 search results - page 409 / 746
» On Formal Modeling of Agent Computations
Sort
View
ICLP
2001
Springer
15 years 11 months ago
Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
K. Narayan Kumar, C. R. Ramakrishnan, Scott A. Smo...
DAC
2007
ACM
15 years 10 months ago
Memory Modeling in ESL-RTL Equivalence Checking
When designers create RTL models from a system-level specification, arrays in the system-level model are often implemented as memories in the RTL. Knowing the correspondence betwe...
Alfred Kölbl, Jerry R. Burch, Carl Pixley
ACSAC
2002
IEEE
15 years 11 months ago
Networking in The Solar Trust Model: Determining Optimal Trust Paths in a Decentralized Trust Network
The Solar Trust Model provides a method by which the sender of a message can be authenticated, and the level of trust that can be placed in the sender of the message or the messag...
Michael Clifford
DKE
2008
135views more  DKE 2008»
15 years 6 months ago
Analyzing interacting WS-BPEL processes using flexible model generation
We address the problem of analyzing the interaction between WS-BPEL processes. We present a technology chain that starts out with a WS-BPEL process and translates it into a Petri ...
Niels Lohmann, Peter Massuthe, Christian Stahl, Da...
ASPDAC
2006
ACM
113views Hardware» more  ASPDAC 2006»
16 years 24 days ago
Transition-based coverage estimation for symbolic model checking
— Lack of complete formal specification is one of the major obstacles for the deployment of model checking. Coverage estimation addresses this issue by revealing the unverified...
Xingwen Xu, Shinji Kimura, Kazunari Horikawa, Take...