156 search results - page 25 / 32 » Practical predicate dispatch |
CAV
2010
Springer
14 years 1 months ago
2010
Springer
We consider the class of finite-state programs executed by an unbounded number of replicated threads communicating via shared variables. The thread-state reachability problem for t...
ATVA
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
CCS
2008
ACM
13 years 11 months ago
2008
ACM
A practically feasible modification to fixed-priority schedulers allows to avoid timing channels despite threads having access to precise clocks. This modification is rather simpl...
ACL
1996
13 years 11 months ago
1996
Lexicalized Tree Adjoining Grammars have proved useful for NLP. However, numerous redundancy problems face LTAGs developers, as highlighted by Vijay-Shanker and Schabes (92). We p...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
An important issue towards a broader acceptance of answer-set programming (ASP) is the deployment of tools which support the programmer during the coding phase. In particular, met...