3680 search results - page 375 / 736 » cases 2010 |
159
click to vote
ENTCS
2000
15 years 6 months ago
2000
Incompleteness results for behavioral logics are investigated. We show that there is a basic finite behavioral specification for which the behavioral satisfaction problem is not r...
154
click to vote
ENTCS
2000
15 years 6 months ago
2000
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound fo...
207
click to vote
ENTCS
2002
15 years 6 months ago
2002
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
186
click to vote
ENTCS
2002
15 years 6 months ago
2002
The MaC system has been developed to provide assurance that a target program is running correctly with respect to formal requirements specification. This is achieved by monitoring...
162
click to vote
ENTCS
2002
15 years 6 months ago
2002
Call-by-push-value is a "semantic machine code", providing a set of simple primitives from which both the call-by-value and call-by-name paradigms are built. We present i...