Sciweavers

1438 search results - page 215 / 288
» An Expressive Extension of TLC
Sort
View
FPCA
1995
15 years 10 months ago
How Much Non-Strictness do Lenient Programs Require?
Lenient languages, such as Id90, have been touted as among the best functional languages for massively parallel machines AHN88]. Lenient evaluation combines non-strict semantics w...
Klaus E. Schauser, Seth Copen Goldstein
CONCUR
1991
Springer
15 years 10 months ago
A Method for the Development of Totally Correct Shared-State Parallel Programs
Abstract. A syntax-directed formal system for the development of totally correct programs with respect to an (unfair) shared-state parallel programming language is proposed. The pr...
Ketil Stølen
DLOG
2007
15 years 8 months ago
Deciding ALBO with Tableau
Abstract. This paper presents a tableau approach for deciding description logics outside the scope of OWL DL and current state-of-the-art tableau-based description logic systems. I...
Renate A. Schmidt, Dmitry Tishkovsky
AIPS
2008
15 years 8 months ago
A Temporal Logic-Based Planning and Execution Monitoring System
As no plan can cover all possible contingencies, the ability to detect failures during plan execution is crucial to the robustness of any autonomous system operating in a dynamic ...
Jonas Kvarnström, Fredrik Heintz, Patrick Doh...
ATVA
2008
Springer
104views Hardware» more  ATVA 2008»
15 years 8 months ago
A Direct Algorithm for Multi-valued Bounded Model Checking
Multi-valued Model Checking is an extension of classical, two-valued model checking with multi-valued logic. Multi-valuedness has been proved useful in expressing additional inform...
Jefferson O. Andrade, Yukiyoshi Kameyama