4047 search results - page 266 / 810 » Algebraic Model Checking |
175
Voted
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
180
click to vote
EUC
2008
Springer
15 years 8 months ago
2008
Springer
Static path analysis is a key process of Worst Case Execution Time (WCET) estimation, the objective of which is to find the execution path that has the largest execution time. Cur...
192
click to vote
STTT
2008
15 years 6 months ago
2008
Explicit model checking algorithms explore the full state space of a system. State spaces are usually treated as directed graphs without any specific features. We gather a large co...
185
click to vote
PVM
2007
Springer
16 years 22 days ago
2007
Springer
llc is a language based on C where parallelism is expressed using compiler directives. The llc compiler produces MPI code which can be ported to both shared and distributed memory ...
171
click to vote
BIRTHDAY
2000
Springer
15 years 11 months ago
2000
Springer
The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather th...