ISSTA

2012

ACM

11 years 9 months ago
2012

ACM

Recent research has suggested that a large class of software bugs fall into the category of inconsistencies, or cases where two pieces of program code make incompatible assumption...

CADE

2011

Springer

12 years 6 months ago
2011

Springer

Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...

ARESEC

2011

12 years 6 months ago
2011

—We formalise in a theorem prover the notion of provable anonymity proposed by Garcia et al. Our formalization relies on inductive deﬁnitions of message distinguish ability and...

PODC

2011

ACM

12 years 9 months ago
2011

ACM

We present a cryptographic framework to achieve access control, privacy of social relations, secrecy of resources, and anonymity of users in social networks. The main idea is to u...

PLDI

2011

ACM

12 years 9 months ago
2011

ACM

Program analysis and veriﬁcation tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...

ENTCS

2006

13 years 6 months ago
2006

To broaden the scope of decision procedures for linear arithmetic, they have to be integrated into theorem provers. Successful approaches e.g. in NQTHM or ACL2 suggest a close int...

CSL

2010

Springer

13 years 7 months ago
2010

Springer

We describe the formalisation of the normal forms of context-free grammars (CFGs) using the HOL4 theorem prover. These straightforward pen and paper proofs easily understood from t...

IJCAI

1989

13 years 7 months ago
1989

In a recent paper, Ginsberg shows how a backward-chaining ATMS can be used to construct a theorem prover for circumscription. Here, this work is extended to handle prioritized cir...

IJCAI

2003

13 years 7 months ago
2003

Query answering over commonsense knowledge bases typically employs a ﬁrst-order logic theorem prover. While ﬁrst-order inference is intractable in general, provers can often b...

FMCAD

2008

Springer

13 years 8 months ago
2008

Springer

We present a method for verifying information flow properties of software programs using inductive assertions and theorem proving. Given a program annotated with information flow a...