Sciweavers

51 search results - page 9 / 11
» cade 2008
Sort
View
CADE
2008
Springer
14 years 10 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
CADE
2008
Springer
14 years 10 months ago
Specification Predicates with Explicit Dependency Information
Specifications of programs use auxiliary symbols to encapsulate concepts for a variety of reasons: readability, reusability, structuring and, in particular, for writing recursive d...
Richard Bubel, Reiner Hähnle, Peter H. Schmit...
CADE
2008
Springer
13 years 11 months ago
LogAnswer - A Deduction-Based Question Answering System (System Description)
LogAnswer is an open domain question answering system which employs an automated theorem prover to infer correct replies to natural language questions. For this purpose LogAnswer o...
Ulrich Furbach, Ingo Glöckner, Hermann Helbig...
CADE
2008
Springer
14 years 10 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
CADE
2008
Springer
14 years 10 months ago
Precise Dynamic Verification of Confidentiality
Confidentiality is maybe the most popular security property to be formally or informally verified. Noninterference is a baseline security policy to formalize confidentiality of sec...
Gurvan Le Guernic