499 search results - page 61 / 100 » LTL satisfiability checking |
SAS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. This paper addresses the problem of checking programs written in an object-oriented language to ensure that they satisfy the information flow policies, confidentiality ...
FCT
2003
Springer
15 years 5 months ago
2003
Springer
This paper presents a method for the decomposition of HML formulae. It can be used to decide whether a process algebra term satisfies a HML formula, by checking whether subterms s...
OOIS
2001
Springer
15 years 4 months ago
2001
Springer
: This paper presents Reconciliation+, a tool-supported method which identifies overlaps between models of different object interactions expressed as UML sequence and/or collaborat...
CONCUR
1989
Springer
15 years 3 months ago
1989
Springer
In summary, RDL is an intuitionistic temporal logic for the specification of requirements and design of time-dependent systems. Coverage of RDL includes a backward chaining theore...
AI
2007
Springer
14 years 12 months ago
2007
Springer
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...