2944 search results - page 471 / 589 » On Well Quasi-orders on Languages |
171
click to vote
CAV
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
181
click to vote
DEBS
2007
ACM
15 years 10 months ago
2007
ACM
Event-based systems are increasingly gaining widespread attention for applications that require integration with loosely coupled and distributed systems for time-critical business...
166
click to vote
DIM
2007
ACM
15 years 10 months ago
2007
ACM
In a history-based trust-management system, users and service providers use information about past transactions to make trust-based decisions concerning current transactions. One ...
173
click to vote
CONCUR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
179
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
Answer-set programming (ASP) is a well-known formalism for declarative problem solving, enjoying a continuously increasing number of diverse applications. However, arguably one of ...