764 search results - page 89 / 153 » On the Expressibility of Stable Logic Programming |
130
click to vote
POPL
2011
ACM
14 years 2 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
116
click to vote
ENTCS
2006
14 years 12 months ago
2006
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are noto...
104
click to vote
ICSE
2004
IEEE-ACM
15 years 12 months ago
2004
IEEE-ACM
We describe an efficient decentralized monitoring algorithm that monitors a distributed program's execution to check for violations of safety properties. The monitoring is ba...
141
click to vote
ICCS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Sensing is at the core of virtually every DDDAS application. Sensing applications typically involve distributed communication and coordination over large self-organized n...
122
click to vote
ICFP
2010
ACM
15 years 27 days ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...