606 search results - page 3 / 122 » Complexity Results for Checking Distributed Implementability |
ICLP
1997
Springer
13 years 11 months ago
1997
Springer
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
ICECCS
2000
IEEE
13 years 12 months ago
2000
IEEE
The goal of result-verificationis toprove that one execution run of a program satisjes its speciJcation. Compared with iniplenzentation-verification,result-verification has a larg...
ICRA
2002
IEEE
14 years 11 days ago
2002
IEEE
This paper describes a set of tools that allows a developer to instrument an autonomous control system to log data at run-time and then analyze that data to verify correct program...
CAV
2009
Springer
14 years 2 days ago
2009
Springer
Priorities are used to control the execution of systems to meet given requirements for optimal use of resources, e.g., by using scheduling policies. For distributed systems, it is ...
IPPS
2000
IEEE
13 years 11 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...