499 search results - page 25 / 100 » LTL satisfiability checking |
IFM
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We present a framework for model checking concurrent software systems which incorporates both states and events. Contrary to other state/event approaches, our work also i...
130
click to vote
EMSOFT
2008
Springer
15 years 1 months ago
2008
Springer
Runtime property checking (as implemented in tools like Purify or Valgrind) checks whether a program execution satisfies a property. Active property checking extends runtime check...
CODES
2010
IEEE
14 years 9 months ago
2010
IEEE
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...
115
click to vote
AISC
1998
Springer
15 years 4 months ago
1998
Springer
Effective optimisation techniques can make a dramatic difference in the performance of knowledge representation systems based on expressive description logics. Because of the corre...
COLING
1992
15 years 1 months ago
1992
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...