2291 search results - page 111 / 459 » Logic Programming and Model Checking |
112
Voted
VMCAI
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The paper presents methods for model checking a class of possibly infinite state concurrent programs using various types of bi-simulation reductions. The proposed method...
122
click to vote
NMELP
1994
15 years 6 months ago
1994
In Prz91], Przymusinski introduced the partial (or 3-valued) stable model semantics which extends the (2-valued) stable model semantics dened originally by Gelfond and Lifschitz G...
108
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
147
Voted
ATVA
2008
Springer
15 years 4 months ago
2008
Springer
Goanna is an industrial-strength static analysis tool used in academia and industry alike to find bugs in C/C++ programs. Unlike existing approaches Goanna uses the off-the-shelf N...
147
click to vote
ENTCS
2006
15 years 2 months ago
2006
A logic for reasoning about states of basic quantum imperative programs is presented. The models of the logic are ensembles obtained by attaching probabilities to pairs of quantum...