Sciweavers

90 search results - page 17 / 18
» On regular temporal logics with past
Sort
View
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
AOSD
2007
ACM
13 years 10 months ago
Open bisimulation for aspects
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
Radha Jagadeesan, Corin Pitcher, James Riely
JFR
2007
150views more  JFR 2007»
13 years 5 months ago
Decisional autonomy of planetary rovers
To achieve the ever increasing demand for science return, planetary exploration rovers require more autonomy to successfully perform their missions. Indeed, the communication dela...
Félix Ingrand, Simon Lacroix, Solange Lemai...
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
PASTE
2004
ACM
13 years 11 months ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick