Sciweavers

1036 search results - page 70 / 208
» Verification Programs for Abduction
Sort
View
91
Voted
ECAI
2010
Springer
15 years 1 months ago
Verifying Properties of Infinite Sequences of Description Logic Actions
The verification problem for action logic programs with non-terminating behaviour is in general undecidable. In this paper, we consider a restricted setting in which the problem be...
Franz Baader, Hongkai Liu, Anees ul Mehdi
123
Voted
SIGSOFT
2007
ACM
16 years 1 months ago
SLEDE: lightweight verification of sensor network security protocol implementations
Finding flaws in security protocol implementations is hard. Finding flaws in the implementations of sensor network security protocols is even harder because they are designed to p...
Youssef Hanna
101
Voted
DAC
2007
ACM
16 years 1 months ago
On Resolution Proofs for Combinational Equivalence
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
102
Voted
ICSE
2008
IEEE-ACM
16 years 1 months ago
Calysto: scalable and precise extended static checking
Automatically detecting bugs in programs has been a long-held goal in software engineering. Many techniques exist, trading-off varying levels of automation, thoroughness of covera...
Domagoj Babic, Alan J. Hu
ECOOP
2008
Springer
15 years 2 months ago
Computing Stack Maps with Interfaces
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
Frédéric Besson, Thomas P. Jensen, T...