Sciweavers

29 search results - page 6 / 6
» Regular Linear Temporal Logic with Past
Sort
View
TIME
2006
IEEE
13 years 11 months ago
In time alone: on the computational power of querying the history
Querying its own history is an important mechanism in the computations, especially those interacting with people or other computations such as transaction processing, electronic d...
Alexei Lisitsa, Igor Potapov
CAV
2005
Springer
127views Hardware» more  CAV 2005»
13 years 11 months ago
Incremental and Complete Bounded Model Checking for Full PLTL
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
Keijo Heljanko, Tommi A. Junttila, Timo Latvala
CONCUR
2011
Springer
12 years 5 months ago
Reasoning about Threads with Bounded Lock Chains
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
Vineet Kahlon
CCS
2005
ACM
13 years 11 months ago
A framework for concrete reputation-systems with applications to history-based access control
In a reputation-based trust-management system, agents maintain information about the past behaviour of other agents. This information is used to guide future trust-based decisions...
Karl Krukow, Mogens Nielsen, Vladimiro Sassone